Compact linear programs for 2SAT
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10398318" target="_blank" >RIV/00216208:11320/19:10398318 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=k1V2.tW8sm" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=k1V2.tW8sm</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2018.02.011" target="_blank" >10.1016/j.ejc.2018.02.011</a>
Alternative languages
Result language
angličtina
Original language name
Compact linear programs for 2SAT
Original language description
For each integer n we present an explicit formulation of a compact linear program, with O(n(3)) variables and constraints, which determines the satisfiability of any 2SAT formula with n boolean variables by a single linear optimization. This contrasts with the fact that the natural polytope for this problem, formed from the convex hull of all satisfiable formulas and their satisfying assignments, has superpolynomial extension complexity. Our formulation is based on multicommodity flows. We also discuss connections of these results to the stable matching problem. (C) 2018 Elsevier Ltd. All rights reserved.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/GA15-11559S" target="_blank" >GA15-11559S: Extended Formulation of Polytopes</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
80
Issue of the periodical within the volume
Srpen
Country of publishing house
GB - UNITED KINGDOM
Number of pages
6
Pages from-to
17-22
UT code for WoS article
000474675900003
EID of the result in the Scopus database
2-s2.0-85045549902