The complexity of very simple Boolean formulas with applications
SIAM Journal on Computing
On the computation of Pfaffians
Discrete Applied Mathematics
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
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
Theoretical Computer Science
Mathematics of Quantum Computation
Mathematics of Quantum Computation
Holographic Algorithms (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
SINGULAR: a computer algebra system for polynomial computations
ACM Communications in Computer Algebra
Matrices and Matroids for Systems Analysis
Matrices and Matroids for Systems Analysis
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Universal quantum gates for single cooper pair box based quantum computing
Quantum Information & Computation
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
Journal of Symbolic Computation
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
Valiant’s holant theorem and matchgate tensors
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
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 |
Holographic circuits are defined here to be circuits in which information is represented as linear superpositions. Holographic circuits when suitably formulated can be emulated on classical computers in polynomial time. The questions we investigate are those of characterizing the complexity classes of computations that can be expressed by holographic circuits.