Phase transitions of PP-complete satisfiability problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 183-189

  Bailey, Delbert D ^a   Dalmau, Víctor ^a   Kolaitis, Phokion G ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PROBABILITIES; BOOLEAN SATISFIABILITY PROBLEMS; COMPLEXITY CLASS; DAVIS-PUTNAM-LOGEMANN-LOVELAND; DECISION PROBLEMS; INTRACTABLE COMPLEXITY; SATISFIABILITY PROBLEMS; UPPER AND LOWER BOUNDS;

ARTIFICIAL INTELLIGENCE; TURING MACHINES;

COMPUTATIONAL COMPLEXITY;

EID: 0012254616     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. D. Achlioptas and G.B. Sorkin. Optimal myopic algorithms for random 3-SAT. In 41st Annual Symposium on Foundations of Computer Science, pages 590-600, 2000.
2. D. Achlioptas. Setting two variables at a time yields a new lower bound for random 3-SAT. In 32nd Annual ACM Symposium on Theory of Computing, pages 28-37, 2000.
3. D. Achlioptas. Lower bounds for random 3-SAT via differential equations. Theoretical Computer Science, 2001. To appear.
4. D. Angluin. On counting problems and the polynomial-time hierarchy. Theoretical Computer Science, 12:161-173, 1980.
5. R.J. Bayardo and J.D. Pehoushek. Counting models using connected components. In 7th Nat'l Conf. on Artificial Intelligence, 2000.
6. E. Birnbaum and E.L. Lozinskii. The good old Davis-Putnam procedure helps counting models. Journal of Artificial Intelligence Research, 10:457-477, 1999. (Pubitemid 30573901)
7. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:161-204, 1994.
8. T. Bylander. A probabilistic analysis of propositional STRIPS planning. Artificial Intelligence, 81:241-271, 1996. (Pubitemid 126349557)
9. M. Cadoli, A. Giovanardi, and M. Schaerf. Experimental analysis of the computational cost of evaluating quantified Boolean formulas. In Proc. 5th Conference of the Italian Association for Artificial Intelligence, volume 218 of LNAI, pages 207-218. Springer-Verlag, 1997.
10. M.-T. Chao and J. Franco. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4):1106-1118, 1986. (Pubitemid 17465858)
11. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In 33th Annual Symposium on Foundations of Computer Science, pages 620-627, 1992.
12. W. Fernandez de la Vega. On random 2-SAT. Manuscript, 1992.
13. I.P. Gent and T. Walsh. Beyond NP: the QSAT phase transition. In Proc. 16th National Conference on Artificial Intelligence, pages 653-658, 1999.
14. J. Gill. Computational complexity of probabilistic Turing machines. SIAM J. Comput., 6(4):675-695, 1977.
15. A. Goerdt. A threshold for unsatisfiability. J. Comput. System Sci., 53(3):469-486, 1996. (Pubitemid 126653479)
16. S. Janson, Y.C. Stamatiou, and M. Vamvakari. Bounding the unsatisfiability threshold of random 3-SAT. Random Structures and Algorithms, 17(2):103-116, 2000.
17. M.L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning. Journal of Automated Reasoning, 1998.
18. M.L. Littman, S.M. Majercik, and T. Pitassi. Stochastic Boolean satisfiability. Journal of Automated Reasoning, 2001. To appear.
19. M. Littman. Initial experiments in stochastic satisfiability. In Proc. of the 16th National Conference on Artificial Intelligence, pages 667-672, 1999.
20. P. Orponen. Dempster's rule of combination is #-P-complete. Artificial Intelligence, 44:245-253, 1990.
21. C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
22. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2):273-302, 1996. (Pubitemid 126374156)
23. B. Selman, D. G. Mitchell, and H. J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996. (Pubitemid 126349547)
24. J. Simon. On some central problems in computational complexity. PhD thesis, Cornell University, Computer Science Department, 1975.
25. S. Toda. On the computational power of PP and ⊕P. In Proceedings 30th IEEE Symposium on Foundations of Computer Science (FOCS'89), Research Triangle Park (North Carolina, USA), pages 514-519, 1989.
26. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8(2):189-201, 1979.
27. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
28. N. C. Wormald. Differential equations for random processes and random graphs. Ann. Appl. Probab., 5(4):1217-1235, 1995.