Depth lower bounds in stabbing planes for combinatorial principles

DOI10.4230/LIPICS.STACS.2022.24MaRDI QIDQ6490973zbMATH OpenFDO

Authors Stephan Stoyanov Danchev, Nicola Galesi, Abdul Azim Abdul Ghani, Barnaby Martin

Publication date 23 April 2024

zbMATH Keywords

computational complexitylower boundscutting planesproof complexitystabbing planes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Depth lower bounds in Stabbing Planes for combinatorial principles

This page was built for publication: Depth lower bounds in stabbing planes for combinatorial principles

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