Some Exact Complexity Results for Straight-Line Computations over Semirings
Journal of the ACM (JACM)
Holographic Algorithms (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Holographic algorithms: The power of dimensionality resolved
Theoretical Computer Science
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Journal of Symbolic 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 |
We propose matchgate tensors as a natural and proper language to develop Valiant’s new theory of Holographic Algorithms. We give a treatment of the central theorem in this theory—the Holant Theorem—in terms of matchgate tensors. Some generalizations are presented.