Depth lower bounds in Stabbing Planes for combinatorial principles

DOI10.46298/lmcs-20(1:1)2024arXiv2102.07622MaRDI QIDQ6137876

No author found.

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.07622

zbMATH Keywords

computational complexitylower boundscutting planesproof complexityStabbing Planes

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of cutting-plane proofs
• Maximal probabilities of convolution powers of discrete uniform distributions
• Covering the cube by affine hyperplanes
• Essential covers of the cube by hyperplanes
• Resolution with counting: dag-like lower bounds and different moduli
• Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
• Hard examples for resolution
• Interpolation by a Game
• Discretely ordered modules as a first-order extension of the cutting planes proof system
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2003
• On the power and limitations of branch and cut

This page was built for publication: Depth lower bounds in Stabbing Planes for combinatorial principles