A threshold for unsatisfiability

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 469-486

  Goerdt, Andreas ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; POLYNOMIALS;

PROPOSITIONAL FORMULAS;

THRESHOLD LOGIC;

EID: 0030388062     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0081     Document Type: Article

References (24)

1. B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inform. Process. Lett. 8 (1979), 121-123.
2. C. A. Brown and P. W. Purdom, An average time analysis of backtracking, SIAM J. Comput. 10 (1981), 583-593.
3. M. T. Chao, "Probabilistic Analysis and Performance Measurement for the Satisfiability Problem," Ph.D. dissertation, Case Western Reserve University, 1984.
4. M. T. Chao and J. Franco, Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput. 15 (1986), 1106-1118.
5. V. Chvátal and E. Szemerédi, Many hard examples for resolution, J. Assoc. Comput. Mach. 35 (1988), 759-768.
6. O. Dubois Counting the number of solutions for instances of satisfiability, Theoret. Comput. Sci. 81 (1991), 49-64.
7. O. Dubois and J. Carlier, Probabilitistic approach to the satisfiability problem, Theoret. Comput. Sci. 81 (1991), 65-75.
8. J. Franco, Probabilistic analysis of the pure literal heuristic for solving the satisfiability problem, Ann. Oper. Res. 1 (1984), 273-289.
9. J. Franco and M. Paull, Probabilistic analysis of the Davis Putnam Procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983), 77-87; 17 (1987), 295-299.
10. J. Franco and M. Paull, Probabilistic analysis of the Davis Putnam Procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983), 77-87; 17 (1987), 295-299.
11. A. Goldberg, P. W. Purdom, and C. A. Brown, Average time analysis of simplified Davis-Putnam Procedures, Inform. Process. Lett. 15 (1982), 72-75; 16 (1983), 213.
12. A. Goldberg, P. W. Purdom, and C. A. Brown, Average time analysis of simplified Davis-Putnam Procedures, Inform. Process. Lett. 15 (1982), 72-75; 16 (1983), 213.
13. R. L. Graham, D. E. Knuth, and O. Patashnik, "Concrete Mathematics," Addison-Wesley, Reading, MA, 1988.
14. P. Hansen, B. Jaumard, and M. Minoux, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, Math. Programming 34 (1986), 223-231.
15. I. Palasti, On the threshold distribution function of cycles in a directed random graph, Studia Math. Hungar. 6 (1971), 67-73.
16. E. M. Palmer, "Graphical Evolution," New York, 1985.
17. S. Ross, "A First Course in Probability," Macmillan, New York, 1988.
18. E. M. Wright, Large cycles in large labelled graphs, Math. Proc. Cambridge Phil. Soc. 78 (1975), 7-17.
19. A. Goerdt, A threshold for unsatisfiability, in "Proceedings, MFCS 1992" (J. M. Havel and V. Koubek, Eds.), Lect. Notes in Comput. Sci., Vol. 692, pp. 264-274, Springer-Verlag, New York/Berlin, 1992.
20. V. Chvátal and B. Reed, Mick gets some (the odds are on his side), in "Proceedings, 33rd FOCS 1992," pp. 620-627.
21. A. M. Frieze and S. Suen, Analysis of a simple heuristics for random instances of 3-SAT, manuscript, 1993.
22. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in "Proceedings, 35th FOCS, 1994," pp. 592-603.
23. A. Broder, A. M. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in "Proceedings, 4th SODA 1993," pp. 322-330.
24. M. Krom, The decision problem for a class of first-order formulas in which all disjunctions are binary, Math Logik Math. 3 (1967), 15-20.