Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing
A Computational Proof of Complexity of Some Restricted Counting Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Classification of a Class of Counting Problems Using Holographic Reductions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Holographic reduction: a domain changed application and its partial converse theorems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science
Holographic reduction for some counting problems
Information Processing Letters
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Computational Complexity of Holant Problems
SIAM Journal on Computing
Gadgets and anti-gadgets leading to a complexity dichotomy
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Some observations on holographic algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A dichotomy for k-regular graphs with {0, 1}-vertex assignments and real edge functions
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions
Theoretical Computer Science
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We propose a new method to prove complexity dichotomy theorems. First we introduce Fibonacci gates which provide a new class of polynomial time holographic algorithms. Then we develop holographic reductions. We show that holographic reductions followed by interpolations provide a uniform strategy to prove \#P-hardness.