Upper and lower bounds for tree-like cutting planes proofs
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 220-228
- https://doi.org/10.1109/lics.1994.316069
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Exponential lower bounds for the pigeonhole principlePublished by Association for Computing Machinery (ACM) ,1992
- Cutting plane versus frege proof systemsPublished by Springer Nature ,1991
- Monotone circuits for matching require linear depthPublished by Association for Computing Machinery (ACM) ,1990
- 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
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979