Journal of the ACM Bibliography

Selected papers that cite this one

• Paul Beame and Toniann Pitassi. Simplified and improved resolution lower bounds. In 37th Annual Symposium on Foundations of Computer Science, pages 274-282, Burlington, Vermont, 14-16 October 1996. IEEE.

• W. Bibel and E. Eder. Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. Journal of the ACM, 44(2):320-344, March 1997.

• Paul E. Dunne and Michele Zito. An improved upper bound on the non-3-colourability threshold. Information Processing Letters, 65(1):17-23, 15 January 1998.

• Jean-Denis Fouks and Jean-Claude Spehner. Meta-resolution: An algorithmic formalisation. Theoretical Computer Science, 166(1-2):147-172, 20 October 1996.

• Alan Frieze and Stephen Suen. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms, 20(2):312-355, March 1996.

• Xudong Fu. Modular coloring formulas are hard for cutting planes proofs. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 595-602, Philadelphia, Pennsylvania, 22-24 May 1996.

• Andreas Goerdt. A threshold for unsatisfiability. Journal of Computer and System Sciences, 53(3):469-486, December 1996.

• Johann A. Makowsky and Abraham Sharell. On average case complexity of SAT for symmetric distribution. Journal of Logic and Computation, 5(1):71-92, February 1995.

• Henri-M. Méjean, Henri Morel, and Gérard Reynaud. A variational method for analysing unit clause search. SIAM Journal on Computing, 24(3):621-649, June 1995.

• Alexander Razborov, Avi Wigderson, and Andrew Yao. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 739-748, El Paso, Texas, 4-6 May 1997.

• Alasdair Urquhart. The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1(4):425-467, December 1995.

• Alasdair Urquhart and Xudong Fu. Simplified lower bounds for propositional proofs. Notre Dame Journal of Formal Logic, 37(4):523-544, Fall 1996.

Shortcuts: