scientific article; zbMATH DE number 512977

MaRDI QIDQ4281687zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 7 April 1994

zbMATH Keywords

cutting plane proof systemFrege proof systemssystems of integer inequalities

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Cutting plane and Frege proofs
• On the complexity of cutting-plane proofs
• Cutting planes, connectivity, and threshold logic

Cited in

(20)

• Understanding cutting planes for QBFs
• Cutting-plane proofs in polynomial space
• Cutting plane and Frege proofs
• Cutting planes, connectivity, and threshold logic
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Restricted cutting plane proofs in Horn constraint systems
• Cutting planes from two-term disjunctions
• Several notes on the power of Gomory-Chvátal cuts
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization
• Cutting planes and the parameter cutwidth
• scientific article; zbMATH DE number 408793 (Why is no real title available?)
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Semantic versus syntactic cutting planes
• scientific article; zbMATH DE number 806744 (Why is no real title available?)
• Theory and Applications of Satisfiability Testing
• On the complexity of cutting-plane proofs
• Circular (Yet Sound) Proofs in Propositional Logic
• Complexity of optimizing over the integers
• Semialgebraic proofs, IPS lower bounds, and the -conjecture: can a natural number be negative?
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281687)