Pages that link to "Item:Q1908818"

The following pages link to Cutting planes, connectivity, and threshold logic (Q1908818):

Displaying 8 items.

• Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
• Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)