Resolution proofs of generalized pigeonhole principles
Authors:
- Samuel R. BussSBSamuel R. Buss
- Győrgy TuránGTGyőrgy Turán
- 1 December 1988
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 62 (3) , 311-317
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial size proofs of the propositional pigeonhole principleThe Journal of Symbolic Logic, 1987
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987
- Hard examples for resolutionJournal of the ACM, 1987
- The intractability of resolutionTheoretical Computer Science, 1985
- Counting problems in bounded arithmeticLecture Notes in Mathematics, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979