Journal of the ACM Bibliography

Selected papers that cite this one

• Noriko H. Arai. Tractability of cut-free Gentzen type propositional calculus with permutation inference. Theoretical Computer Science, 170(1-2):129-144, 15 December 1996.

• 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.

• Paul Beame and Toniann Pitassi. An exponential separation between the parity principle and the pigeonhole principle. Annals of Pure and Applied Logic, 80(3):195-228, 26 August 1996.

• 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.

• Maria Paola Bonacina and Jieh Hsiang. On the modelling of search in theorem proving -- towards a theory of strategy analysis. Accepted for publication in Information and Computation. Final manuscript received for publication May 19, 1998.

• Jean-Denis Fouks and Jean-Claude Spehner. Meta-resolution: An algorithmic formalisation. Theoretical Computer Science, 166(1-2):147-172, 20 October 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.

• Russell Impagliazzo, Toniann Pitassi, and Alasdair Urquhart. Upper and lower bounds for tree-like cutting planes proofs. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 220-228, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

• 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.

• 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: