Generalized resolution and cutting planes

This publication has 12 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• The intractability of resolution
  Theoretical Computer Science, 1985
• The relative efficiency of propositional proof systems
  The Journal of Symbolic Logic, 1979
• Facet of regular 0–1 polytopes
  Mathematical Programming, 1975
• Characterisations of Totally Unimodular, Balanced and Perfect Matrices
  Published by Springer Nature ,1975
• Perfect zero–one matrices
  Mathematical Programming, 1974
• Canonical Cuts on the Unit Hypercube
  SIAM Journal on Applied Mathematics, 1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• A Way to Simplify Truth Functions
  The American Mathematical Monthly, 1955
• The Problem of Simplifying Truth Functions
  The American Mathematical Monthly, 1952