Some results on matchgates and holographic algorithms

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

Volumn 4051 LNCS, Issue , 2006, Pages 703-714

  Cai, Jin Yi ^a   Choudhary, Vinay ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; GATEWAYS (COMPUTER NETWORKS); POLYNOMIALS; PROBLEM SOLVING;

CORRESPONDING SETS; GRASSMANN-PLUCKER IDENTITIES; HOLOGRAPHIC ALGORITHMS; MATCHGATES;

HOLOGRAPHY;

EID: 33746335976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_61     Document Type: Conference Paper

References (20)

1. A. C. Aitken, Determinants and Matrices, Oliver and Boyd, London, 1951.
2. Jin-Yi Cai, V. Choudhary. Valiant's Holant Theorem and Matchgate Tensors. To appear in the Proceedings of Theory and Applications of Models of Computation, TAMC 2006. Lecture Notes in Computer Science. Also at ECCC TR05-118.
3. Jin-Yi Cai, V. Choudhary. On the Theory of Matchgate Computations. Submitted. Also available at ECCC TR06-018.
4. Jin-Yi Cai, V. Choudhary. Some Results on Matchgates and Holographic Algorithms. ECCC TR06-048.
5. F. Hadlock, Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing, 4 (1975): 221-225.
6. K. Jansen, M. Karpinski, A. Lingas, and E. Seidel. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Proceedings of 18th Symposium on Theoretical Aspects in Computer Science (STAGS) 2001, LNCS 2010: 365-375, Springer (2001).
7. M. R, Jerrum, Two-dimensional Monomer-Dimer Systems are Computationally Intractable. Journal of Statistical Physics, 48, 1/2: 121-134 (1987).
8. (Also Journal of Statistical Physics, 59, 3/4: 1087-1088 (1990)).
9. P. W. Kasteleyn. The statistics of dimers on a lattice. Physica, 27: 1209-1225 (1961).
10. P. W. Kasteleyn. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, (F. Harary, ed.), Academic Press, London, 43-110 (1967).
11. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, NorthHolland, Amsterdam, p. 309, 1977.
12. K. Murota. Matrices and Matroids for Systems Analysis, Springer, Berlin, 2000.
13. H. N. V. Temperley and M. E. Fisher. Dimer problem in statistical mechanics an exact result. Philosophical Magazine 6: 1061-1063 (1961).
14. S. P. Vadhan, The Complexity of Counting in Sparse, Regular and Planar Graphs. SIAM Journal on Computing, 8(1): 398-427 (2001).
15. L. G. Valiant. Quantum circuits that can be simulated classically in polynomial time. SIAM Journal on Computing, 31(4): 1229-1254 (2002).
16. L. G. Valiant, Expressiveness of Matchgates. Theoretical Computer Science, 281(1): 457-471 (2002).
17. See also Theoretical Computer Science, 299: 795 (2003).
18. L. G. Valiant. Holographic Algorithms (Extended Abstract). In Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004, 306-315. A more detailed version appeared in Electronic Colloquium on Computational Complexity Report TR05-099.
19. L. G. Valiant. Holographic circuits. In Proc. 82nd International Colloquium on Automata, Languages and Programming, 1-15, 2005.
20. L. G. Valiant. Completeness for parity problems. In Proc. 11th International Computing and Combinatorics Conference, 2005.