A threshold for unsatisfiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 629 LNCS, Issue , 1992, Pages 264-274

  Goerdt, Andreas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBABILITY DISTRIBUTIONS;

GRAPH-THEORETIC; PROPOSITIONAL FORMULAS; RANDOM GRAPHS; SATISFIABILITY; THRESHOLD PROPERTIES; UNIFORM DISTRIBUTION;

GRAPH THEORY;

EID: 84990644838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55808-x_25     Document Type: Conference Paper

References (12)

1. B. Aspvall, M. F. Plass and R.E. Tarjan: A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters 8, 1979.
2. M. T. Chao and J. Franco: Probalistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput 15 (1986), pp. 1106-1118.
3. V. Chvatal and E. Szemerdi: Many hard examples for resolution, J. AMC 35 (1988), pp. 759-768.
4. O. Dubois: Counting the number of solutions for instances of satisfiability, Theoret. Comp. Sci. 81 (1991), pp. 49-64.
5. J. Franco: Probabilistic analysis of the pure literal heuristic for solving the satisfiability problem, Annals of Operations Research 1 (1984), pp. 273-289.
6. A. Goldberg, P. W. Purdom, and C. A. Brown: Averge time analyses of simplified Davis-Putnam Procedures, Information Processing Letters 15 (1982), pp. 72-75 (Errata 16 (1983), 213).
7. R. L. Graham, D. E. Knuth, and O. Patashnik: “Concrete Mathematics”, Addison Wesley, Reading, Massachusetts, December 1988.
8. P. Hansen, B. Jaumard, and M. Minoux: A linear expected-time algoritm for deriving all logical conclusions implied by a set of boolean inequalities, Mathematical Programming 34 (1986), pp. 223-231.
9. L. Palasti: Cn the threshold distribution function of cycles in a directed random graph, Studia Scientiarum Math. Hun. 6 (1971), pp. 67-73.
10. E. M. Palmer: “Graphical evolution”, J. Wiley and Sons, New York, 1985.
11. S. Ross: “A first course in probability”, Macmillan, New York, 1976.
12. E. M. Wright: Large cycles in large labelled graphs, Math. Proc. Camb. Phil. Soc. 78 (1975), pp. 7-17.