The complexity of reliability computations in planar and acyclic graphs
SIAM Journal on Computing
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
The number of Hamiltonian paths in a rectangular grid
Discrete Mathematics
The Complexity of Planar Counting Problems
SIAM Journal on Computing
Tally NP sets and easy census functions
Information and Computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
| Hi-index | 0.00 |