Holographic algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 306-315

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL STRUCTURES; COMPUTATIONAL PROBLEMS; HOLOGRAPHIC REDUCTION; INTEGER COEFFICIENT;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HOLOGRAPHY; STATISTICAL METHODS;

PROBLEM SOLVING;

EID: 17744373330     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Basu, S., Pollack, R., and Roy, M.-F. 2003. Algorithms in Real Algebraic Geometry, Spring-Verlag, Berlin.
2. Baxter, R. J. 1982. Exactly Solved Models in Statistical Physics, Academic Press, London.
3. Cook, S. A. 1971. The complexity of theorem proving procedures. Proc. 3rd ACM Symp. on Theory of Computing: 151-158.
4. Fisher, M. E. 1961. Statistical mechanics of dimers on a plane lattice, Phys. Rev. 124:1664-1672.
5. Hastad, J. 2001. Some optimal inapproximability results, Journal of ACM 48: 798-859.
6. Hunt, H. B., Marathe, M. V., Radhakrishnan, V., and Stearns, R. E. 1998. The complexity of planar counting problems, SIAM J. Comput. 27, 4:1142-1167.
7. Jaeger, F., Vertigan, D. L., and Welsh, D. J. A. 1990. On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Comb. Phil. Soc. 108: 35-53.
8. Jerrum, M. R. 2003. Counting, Sampling and Integrating: Algorithms and Complexity, Birkhauser, Basel, Switzerland.
9. Jerrum, M. R. and Snir, M. 1982. Some exact complexity results for straight-line computations over semirings, J. ACM 29(3): 874-897.
10. Jerrum, M. R. 1987. Two-dimensional monomerdimer systems are computationally intractable, J. Statistical Physics 48, 1/2: 121-134. (Also 1990, 59,3/4: 1087-1088.)
11. Jerrum, M. R. 1987. Two-dimensional monomerdimer systems are computationally intractable, J. Statistical Physics 48, 1/2: 121-134. (Also 1990, 59,3/4: 1087-1088.)
12. Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), Plenum Press, New York, pp. 85-103.
13. Kasteleyn, P. W. 1961. The statistics of dimers on a lattice, Physica 27:1209-1225.
14. Kasteleyn, P. W. 1967. Graph theory and crystal physics. In Graph Theory and Theoretical Physics (F. Harary, ed.), Academic Press, London, 43-110.
15. Krishnamoorthy, M. S. and Deo, N. 1979. Nodedeletion NP-complete problems, SIAM J. Comput. 8, 4: 619-625.
16. Lewis, J. M. and Yannakakis, M. 1980. The node deletion problem for hereditary properties is NP-complete, J. Comp. and Syst. Sciences 20:219-230.
17. Lichtenstein, D. 1982. Planar formulae and their uses, SIAM J. Comput. 11, 2:329-343.
18. Lieb, E. H. 1967a. Exact solution of the problem of the entropy of two-dimensional ice, Phys. Rev. Lett. 18: 692-694.
19. Lovasz. L., and Plummer, M. D. 1986. Matching Theory, North-Holland, Amsterdam.
20. Pan, V.V. 1997. Solving polynomial equations: some history and recent papers. SIAM Review, 39:2, 187-220.
21. Pauling, L. 1935. J. Am. Chem. Soc. 57, 2680.
22. Strassen, V. 1969. Gaussian elimination is not optimal, Numerische Mathematik 14(3): 354-356.
23. Tardos, E. 1987. The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica 7:141-142.
24. Temperley, H. N. V. and Fisher, 1961. M. E. Dimer problems in statistical mechanics -An exact result, Philosophical Magazine 6: 1061-1063.
25. Vadhan, S. P. 2001. The complexity of counting in sparse, regular and planar graphs, SIAM J. Comput. 31(2): 398-427.
26. Valiant, L. G. 1979a. The complexity of computing the permanent, Theoretical Computer Science 8:189-201. V
27. Valiant, L. G. 1979b. The complexity of enumeration and reliability problems, SIAM J. on Comput. 8, 3:410-421.
28. Valiant, L. G. 1980. Negation can be exponentially powerful, Theoretical Computer Science 12: 303-314.
29. Valiant L. G. 2002. Quantum circuits that can be simulated classically in polynomial time, SIAM J on Computing, 31:4, 1229-1254.
30. Vertigan, D.L. and Welsh, D.J.A. 1992. The computational complexity of the Tutte plane: The bipartite case. Comb. Probab. Comput. 1(2): 181-187.
31. Welsh, D. J. A. 1993. Complexity: Knots, Colourings and Counting, Cambridge University Press, 1993.