Valiant's Holant Theorem and matchgate tensors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3959 LNCS, Issue , 2006, Pages 248-261

  Cai, Jin Yi ^a   Choudhary, Vinay ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; TENSORS; THEOREM PROVING;

HOLOGRAPHIC ALGORITHMS; MATCHGATE TENSORS; VALIANT'S HOLANT THEOREM;

COMPUTATION THEORY;

EID: 33745826702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_24     Document Type: Conference Paper

References (12)

1. C. T. J. Dodson and T. Poston. Tensor Geometry, Graduate Texts in Mathematics 130, Second edition, Springer-Verlag, New York, 1991.
2. M. Jerrum and M. Snir: Some Exact Complexity Results for Straight-Line Computations over Semirings. J. ACM 29(3): 874-897 (1982).
3. P. W. Kasteleyn. The statistics of dimers on a lattice. Physica, 27: 1209-1225 (1961).
4. P. W. Kasteleyn. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, (F. Harary, ed.), Academic Press, London, 43-110 (1967).
5. V. Strassen, "Gaussian Elimination is Not Optimal." Numerische Mathematik 13, 35 4-356, 1969.
6. E. Tardos: The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8(1): 141-142 (1988).
7. H. N. V. Temperley and M. E. Fisher. Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 6: 1061-1063 (1961).
8. L. G. Valiant: Negation can be Exponentially Powerful. Theor. Comput. Sci. 12: 303-314 (1980).
9. L. G. Valiant. Holographic Algorithms (Extended Abstract). In Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004, 306-315.
10. A more detailed version appeared in Electronic Colloquium on Computational Complexity Report TR05-099.
11. L. G. Valiant. Holographic circuits. In Proc. 32nd International Colloquium on Automata, Languages and Programming, 1-15, 2005.
12. L. G. Valiant. Completeness for parity problems. In Proc. 11th International Computing and Combinatorics Conference, 2005.