On semantic cutting planes with very small coefficients

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00489225" target="_blank" >RIV/67985840:_____/18:00489225 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2018.04.007" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2018.04.007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2018.04.007" target="_blank" >10.1016/j.ipl.2018.04.007</a>

Result language
angličtina
Original language name
On semantic cutting planes with very small coefficients
Original language description
Cutting planes proofs for integer programs can naturally be defined both in a syntactic and in a semantic fashion. Filmus et al. (STACS 2016) proved that semantic cutting planes proofs may be exponentially stronger than syntactic ones, even if they use the semantic rule only once. We show that when semantic cutting planes proofs are restricted to have coefficients bounded by a function growing slowly enough, syntactic cutting planes can simulate them efficiently. Furthermore if we strengthen the restriction to a constant bound, then the simulating syntactic proof even has polynomially small coefficients.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)