On the construction of parallel computers from various bases of Boolean functions
Theoretical Computer Science
NP is as easy as detecting unique solutions
Theoretical Computer Science
The complexity of very simple Boolean formulas with applications
SIAM Journal on Computing
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third 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
Holographic Algorithms (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Progress in computational complexity theory
Journal of Computer Science and Technology
Holographic algorithms: from art to science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Holographic algorithms with unsymmetric signatures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Holographic algorithms: guest column
ACM SIGACT News
Basis Collapse in Holographic Algorithms
Computational Complexity
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Valiant’s holant theorem and matchgate tensors
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Some observations on holographic algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Some results on matchgates and holographic algorithms
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Holographic algorithms: the power of dimensionality resolved
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
In this talk we shall review recent work on holographic algorithms and circuits. This work can be interpreted as offering formulations of the question of whether computations within such complexity classes as NP, ⊕P, BQP, or #P, can be efficiently computed classically using linear algebra. The central part of the theory is the consideration of gadgets that map simple combinatorial constraints into gates, assemblies of which can be evaluated efficiently using linear algebra. The combinatorial constraints that appear most fruitful to investigate are the simplest ones that correspond to problems complete in these complexity classes. With this motivation we shall in this note consider the parity class ⊕P for which our understanding of complete problems is particularly limited. For example, among the numerous search problems for which the existence of solutions can be determined in P and the counting problem is known to be #P-complete, the #P-completeness proof does not generally translate to a ⊕P-completeness proof. We observe that in one case it does, and enumerate several natural problems for which the complexity of parity is currently unresolved. We go on to consider two examples of NP-complete problems for which ⊕P-completeness can be proved but is not immediate: Hamiltonian circuits for planar degree three graphs, and satisfiability of read-twice Boolean formulae.