scientific article; zbMATH DE number 512977
From MaRDI portal
Publication:4281687
zbMath0796.03056MaRDI QIDQ4281687
Publication date: 7 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Complexity of proofs (03F20)
Related Items (6)
Cutting planes, connectivity, and threshold logic ⋮ Circular (Yet Sound) Proofs in Propositional Logic ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Understanding cutting planes for QBFs ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
This page was built for publication: