Holographic algorithms

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1565-1594

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Computational complexity; Enumeration

Indexed keywords

COMBINATORIAL PROBLEMS; COMPLETE PROBLEMS; COMPLEX NUMBERS; COMPLEXITY CLASSES; COMPLEXITY THEORIES; COMPUTATIONAL PROBLEMS; EFFICIENT REDUCTIONS; ENUMERATION; EXPONENTIAL TIMES; FINITE SYSTEMS; HOLOGRAPHIC REDUCTIONS; INTEGER COEFFICIENTS; INTERFERENCE PATTERNS; POLYNOMIAL EQUATIONS; POLYNOMIAL SYSTEMS; POLYNOMIAL TIMES;

COMPUTATIONAL COMPLEXITY; KETONES; POLYNOMIAL APPROXIMATION; SOLUTIONS;

PROBLEM SOLVING;

EID: 54849418067     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070682575     Document Type: Article

References (63)

1. R. BARBANCHON, On unique graph 3-colorability and parsimonious reductions in the plane, Theoret. Comput. Sci., 319 (2004), pp. 455-482.
2. S. BASU, R. POLLACK, AND M.-F. ROY, Algorithms in Real Algebraic Geometry, Springer-Verlag, Berlin, 2003.
3. R. J. BAXTER, Exactly Solved Models in Statistical Physics, Academic Press, London, 1982.
4. P. W. BEAME, S. A. COOK, AND H. J. HOOVER, Log depth circuits for division and related problems, SIAM J. Comput., 15 (1986), pp. 994-1003.
5. S. J. BERKOWITZ, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett., 18 (1984), pp. 147-150.
6. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, SIAM J. Comput., 26 (1997), pp. 1411-1473.
7. P. BÜRGISSER, Completeness and Reduction in Algebraic Complexity, Springer-Verlag, Berlin, 2000.
8. P. BÜRGISSER, M. CLAUSEN, AND M. A. SHOKROLLAHI, Algebraic Complexity Theory, Springer-Verlag, Berlin, 1996.
9. J.-Y. CAI AND V. CHOUDHARY, Valiant's Holant theorem and matchgate tensors, in Theory and Applications of Models of Computation, Lecture Notes in Comput. Sci. 3959, Springer-Verlag, Berlin, 2006, pp. 248-261.
10. J.-Y. CAI AND V. CHOUDHARY, On the Theory of Matchgate Computations, in Electronic Colloquium on Computational Complexity, ECC-018, 2006.
11. J.-Y. CAI AND V. CHOUDHARY, Some results on matchgates and holographic algorithms, in Automata, Languages, and Programming, Part I, Lecture Notes in Comput. Sci. 4051, Springer-Verlag, Berlin, 2006, pp. 703-714.
12. J.-Y. CAI AND P. LU, Holographic algorithms: From art to science, in Proceedings of the 39th ACM Symposium on Theory of Computing, ACM, New York, 2007, pp. 401-410.
13. J.-Y. CAI AND P. LU, Holographic algorithms: The power of dimensionality resolved, in International Colloquium on Automata, Languages, and Programming, 2007, pp. 631-642.
14. S. A. COOK, The complexity of theorem proving procedures, in Proceedings of the 3rd ACM Symposium on Theory of Computing, ACM, New York, 1971, pp. 151-158.
15. L. J. COWEN, W. GODDARD, AND C. E. JESURUM, Defective coloring revisited, J. Graph Theory, (1997), pp. 205-219.
16. D. DEUTSCH, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97-117.
17. M. E. FISHER, Statistical mechanics of dimers on a plane lattice, Phys. Rev., 124 (1961), pp. 1664-1672.
18. M. R. GAREY AND D. S. JOHNSON, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math., 32 (1977), pp. 826-834.
19. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
20. M. R. GAREY, D. S. JOHNSON, AND L. STOCKMEYER, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1 (1976), pp. 237-267.
21. M. R. GAREY, D. S. JOHNSON, AND R. E. TARJAN, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5 (1976), pp. 704-714.
22. F. HADLOCK, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput., 4 (1975), pp. 221-225.
23. J. HASTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
24. H. B. HUNT, M. V. MARATHE, V. RADHAKRISHNAN, AND R. E. STEARNS, The complexity of planar counting problems, SIAM J. Comput., 27 (1998), pp. 1142-1167.
25. F. JAEGER, D. L. VERTIGAN, AND D. J. A. WELSH, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc., 108 (1990), pp. 35-53.
26. M. R. JERRUM, Two-dimensional monomer-dimer systems are computationally intractable, J. Statist. Phys., 48 (1987), pp. 121-134.
27. M. R. JERRUM, Erratum: "Two-dimensional monomer-dimer systems are computationally intractable," J. Statist. Phys., 59 (1990), pp. 1087-1088.
28. M. R. JERRUM, Counting, Sampling and Integrating: Algorithms and Complexity, Birkhäuser, Basel, 2003.
29. M. R. JERRUM AND M. SNIR, Some exact complexity results for straight-line computations over semirings, J. ACM, 29 (1982), pp. 874-897.
30. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
31. P. W. KASTELEYN, The statistics of dimers on a lattice, Physica, 27 (1961), pp. 1209-1225.
32. P. W. KASTELEYN, Graph theory and crystal physics, in Graph Theory and Theoretical Physics, F. Harary, ed., Academic Press, London, 1967, pp. 43-110.
33. M. S. KRISHNAMOORTHY AND N. DEO, Node-deletion NP-complete problems, SIAM J. Comput., 8 (1979), pp. 619-625.
34. J. M. LEWIS AND M. YANNAKAKIS, The node deletion problem for hereditary properties is NP-complete, J. Comput. System Sci., 20 (1980), pp. 219-230.
35. D. LICHTENSTEIN, Planar formulae and their uses, SIAM J. Comput., 11 (1982), pp. 329-343.
36. E. H. LIEB, Exact solution of the problem of the entropy of two-dimensional ice, Phys. Rev. Lett., 18 (1967), pp. 692-694.
37. E. H. LIEB, Residual entropy of square ice, Phys. Rev., 162 (1967), pp. 162-172.
38. E. H. LIEB, Exact solution of the F model of an antiferroelectric, Phys. Rev. Lett., 18 (1967), pp. 1046-1048.
39. E. H. LIEB, Exact solution of the two-dimensional Slater KDP model of a ferroelectric, Phys. Rev. Lett., 19 (1967), pp. 108-110.
40. R. J. LIPTON, D. J. ROSE, AND R. E. TARJAN, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
41. M. LISKIEWICZ, M. OGIHARA, AND S. TODA, The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes, Theoret. Comput. Sci., 304 (2003), pp. 129-156.
42. L. LOVÁSZ AND M. D. PLUMMER, Matching Theory, North-Holland, Amsterdam, 1986.
43. M. MAHAJAN AND V. VINAY, Determinant: Old algorithms, new insights, SIAM J. Discrete Math., 12 (1999), pp. 474-490.
44. G. I. ORLOVA AND Y. G. DORFMAN, Finding the maximum cut in a graph, Engineering Cybernetics, 10 (1972), pp. 502-506.
45. V. Y. PAN, Solving a polynomial equation: Some history and recent progress, SIAM Rev., 39 (1997), pp. 187-220.
46. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
47. L. PAULING, The structure and entropy of ice and of other crystals with some randomness of atomic arrangement, J. Amer. Chem. Soc., 57 (1935), p. 2680.
48. V. STRASSEN, Gaussian elimination is not optimal, Numer. Math., 14 (1969), pp. 354-356.
49. E. TARDOS, The gap between monotone and nonmonotone circuit complexity is exponential, Combinatorica, 7 (1987), pp. 141-142.
50. H. N. V. TEMPERLEY AND M. E. FISHER, Dimer problems in statistical mechanics - an exact result Philosophical Magazine, 6 (1961), pp. 1061-1063.
51. S. P. VADHAN, The complexity of counting in sparse, regular, and planar graphs, SIAM J. Comput., 31 (2001), pp. 398-427.
52. L. G. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.
53. L. G. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
54. L. G. VALIANT, Negation can be exponentially powerful, Theoret. Comput. Sci., 12 (1980), pp. 303-314.
55. L. G. VALIANT, Why is Boolean complexity theory difficult?, in Boolean Function Complexity, M. S. Paterson, ed., London Math. Soc. Lecture Note Ser. 169, Cambridge University Press, Cambridge, UK, 1992, pp. 84-94.
56. L. G. VALIANT, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput., 31 (2002), pp. 1229-1254.
57. L. G. VALIANT, Expressiveness of matchgates, Theoret. Comput. Sci., 289 (2002), pp. 457-471.
58. L. G. VALIANT, Holographic circuits, in Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 3980, Springer-Verlag, Berlin, 2005, pp. 1-15.
59. L. G. VALIANT, Completeness for parity problems, in Proceedings of the 11th International Computing and Combinatonics Conference, Lecture Notes in Comput. Sci. 3959, Springer-Verlag, Berlin, 2005, pp. 1-9.
60. L. G. VALIANT, Accidental algorithms, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2006, pp. 509-517.
61. D. L. VERTIGAN AND D. J. A. WELSH, The computational complexity of the Tutte plane: The bipartite case, Combin. Probab. Comput., 1 (1992), pp. 181-187.
62. D. J. A. WELSH, Complexity: Knots. Colourings and Counting, Cambridge University Press, Cambridge, UK, 1993.
63. M. XIA, P. ZHANG, AND W. ZHAO, The complexity of counting on 3-regular planar graphs, Theoret. Comput. Sci., 384 (2007), pp. 111-125.