The Space Complexity of Cutting Planes Refutations

@article{Galesi2014TheSC,
  title={The Space Complexity of Cutting Planes Refutations},
  author={Nicola Galesi and Pavel Pudl{\'a}k and Neil Thapen},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2014},
  volume={21},
  pages={138}
}
We study the space complexity of the cutting planes proof system, in which the lines in a proof are integral linear inequalities. We measure the space used by a refutation as the number of inequalities that need to be kept on a blackboard while verifying it. We show that any unsatisfiable set of inequalities has a cutting planes refutation in space five. This is in contrast to the weaker resolution proof system, for which the analogous space measure has been well-studied and many optimal lower… CONTINUE READING

Similar Papers

Loading similar papers…