On the complexity of cutting plane proofs using split cuts

Sanjeeb Dash. On the complexity of cutting plane proofs using split cuts. Electronic Colloquium on Computational Complexity (ECCC), 15(084), 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.