The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
SIGACT News complexity theory column 41
ACM SIGACT News
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Hi-index | 0.00 |