Counting linear extensions is #P-complete
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Graph orientations with no sink and an approximation for a hard case of #SAT
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On unique graph 3-colorability and parsimonious reductions in the plane
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Inapproximability of the Tutte polynomial
Information and Computation
Connection Matrices for MSOL-Definable Structural Invariants
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Monomial bases for broken circuit complexes
European Journal of Combinatorics
Complexity of Approximating the Vertex Centroid of a Polyhedron
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Most General Edge Elimination Polynomial - Thickening of Edges
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Complexity of the Bollobás-Riordan polynomial: exceptional points and uniform reductions
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
The complexity of the cover polynomials for planar graphs of bounded degree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
ACM Transactions on Architecture and Code Optimization (TACO)
Complexity of approximating the vertex centroid of a polyhedron
Theoretical Computer Science
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
| Hi-index | 0.00 |