On the Width of Semialgebraic Proofs and Algorithms

DOI10.1287/moor.2016.0840zbMath1386.90128OpenAlexW2572894540WikidataQ113749921 ScholiaQ113749921MaRDI QIDQ4595958

Alexander A. Razborov

Publication date: 7 December 2017

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ab506cbba22d7267f7770b7b5b5c6853c2314c6e

zbMATH Keywords

cutting planesproof complexityLovasz-Schrijverproof width

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Complexity of proofs (03F20)

Related Items (4)

On space and depth in resolution ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II

This page was built for publication: On the Width of Semialgebraic Proofs and Algorithms