Accidental algorthims

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

Volumn , Issue , 2006, Pages 509-517

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3CNF FORMULAE; INDIVIDUAL PROBLEMS; SYSTEMATIC EXPLORATIONS; VERTEX COVER PROBLEM;

COMPUTATIONAL COMPLEXITY; HOLOGRAPHY; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMS;

EID: 35448942437     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.7     Document Type: Conference Paper

References (28)

1. H. Aizenstein and L. Pitt. Exact learning of read-twice dnf formulas. Proc of the 32th Symposium on Foundations of Computer Science, pages 170-179, 1991.
2. R. Bubley and M. Dyer. Graph orientations with no sink and an approximation for a hard case of #SAT. ACM SODA, pages 248-257, 1997.
3. J.-Y. Cai and V. Choudhary. On the theory of matchgate computations. ECCC, 018, 2006.
4. J.-Y. Cai and V. Choudhary. Results on matchgates and holographic algorithms. ICALP 2006, LNCS Springer-Verlag, 4051:703-714, 2006.
5. J.-Y. Cai and V. Choudhary. Valiant's Holant theorem and matchgate tensors. TAMC 2006, LNCS Springer-Verlag, 3959:248-261, 2006.
6. J.-Y. Cai and P. Lu. personal communication, June 2006.
7. M. Cook and J. Bruck. Implementability among predicates. Technical report, California Institute ofTechnology, Pasadena, CA, 2005.
8. S. A. Cook. The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
9. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. of Symbolic Computation, 9:251-280, 1990.
10. T. Feder. Fanout limitations on constraint systems. Theor. Comput. Sci., 255(1-2):281-293, 2001.
11. G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 3.0, a computer algebra system for polynomial computations. Centre for Computer Algebra, University of Kaiserslautern, 2005. http://www.singular.uni-kl.de.
12. T. Hancock. Learning 2-DNF formulas and k-decision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 199-209, Santa Cruz, California, 1991. Morgan Kaufmann.
13. H. Hunt, M. Marathe, V. Radhakrishnan, and R. Stearns. The complexity of planar counting problems. SIAM J. Comput., 27(4):1142-1167, 1998.
14. H. B. Hunt and R. E. Stearns. The complexity of very simple boolean formulas with applications. SIAM J. Comput., 19(1):44-70, 1990.
15. M. Jerrum. Two-dimensional monomer-dimer systems are computationally intractible. J. Stat. Phys., 48:121-134., 1987.
16. P. W. Kasteleyn. Graph theory and crystal physics. In F. Harary, editor, Graph Theory and Theoretical Physics, pages 43-110. Academic Press, New York, 1967.
17. D. Lichtenstein. Planar formulae and their uses. SIAM J. on Computing, 11:329-343, 1982.
18. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346-358, 1979.
19. T. Neary and D. Woods. P-completeness of cellular automaton rule 110. ICALP 2006, Lecture Notes in Computer Science, Springer-Verlag 4051, 132-143, 2006.
20. C. H. Papadimitriou and S. Zachos. Two remarks on the power of counting. Theoretical Computer Science, pages 269-276, 1983.
21. S. P. Vadhan. The complexity of counting in sparse, regular, and planar graphs. SIAM J. on Computing, 31:398-427, 2001.
22. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
23. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8:410-421, 1979.
24. L. G. Valiant. Quantum circuits that can be simulated classically in polynomial time. SIAM J. on Computing, 31(4): 1229-1254, 2002.
25. L. G. Valiant. Holographic algorithms (extended abstract). Proc 45th Annual IEEE Symposium on Foundations of Computer Science, pages 306-315, Oct 17-19 2004. IEEE Press.
26. L. G. Valiant. Completeness for parity problems. In Proc 11th International Computing and Combinatorics Conference Aug 16-19, Kunming, China, LNCS, volume 3959. Springer-Verlag 1-9, 2005.
27. L. G. Valiant. Holographic algorithms, ECCC Report. TR05-099, 2005.
28. M. Xia and W. Zhao. #3-regular bipartite planar vertex cover is #P-complete. TAMC 2006, LNCS, 3959:356-364, 2006. Springer-Verlag.