1. M. Buro and H. Kleine Büning, Report on a SAT competition,EATCS Bulletin, No. 49 (February, 1993) 143–151.
2. A. Frieze and S. Suen, Analysis of two simple heuristics on a random instance ofk-SAT, to appear inJournal of Algorithms (1996).
3. L.M. Kirousis, E. Kranakis and D. Krizanc, Approximating the unsatisfiability threshold of random formulas, Carleton University, School of Computer Science, TR-95-26 (1995).
4. S.A. Cook, The complexity of theorem-proving procedures,Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971) pp. 151–158.
5. J.M. Crawford and L.D. Auton,Experimental Results on the Crossover Point in Satisfiability Problems (DIMACS, Rutgers University, New Brunswick, NJ 08903, 1993).