The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
A worst-case time upper bound for counting the number of independent sets
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Improved inapproximability results for counting independent sets in the hard-core model
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
#3-Regular bipartite planar vertex cover is #p-complete
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Counting maximal independent sets in subcubic graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
| Hi-index | 0.00 |