Representations of monotone Boolean functions by linear programs

0477105 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel - de Oliveira Oliveira, Mateus
Representations of monotone Boolean functions by linear programs.
32nd Computational Complexity Conference (CCC 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (O’Donnell, R.), s. 1-14, č. článku 3. Leibniz International Proceedings in Informatics, 79. ISBN 978-3-95977-040-8. ISSN 1868-8969.
[32nd Computational Complexity Conference (CCC 2017). Riga (LT), 06.07.2017-09.07.2017]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : Monotone Linear Programming Circuits * Lovász-Schrijver Proof System * Cutting-Planes Proof System
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://drops.dagstuhl.de/opus/volltexte/2017/7520

We introduce the notion of monotone linear-programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1. MLP circuits are superpolynomially stronger than monotone Boolean circuits. 2. MLP circuits are exponentially stronger than monotone span programs. 3. MLP circuits can be used to provide monotone feasibility interpolation theorems for Lovasz-Schrijver proof systems, and for mixed Lovasz-Schrijver proof systems. 4. The Lovasz-Schrijver proof system cannot be polynomially simulated by the cutting planes proof system. This is the first result showing a separation between these two proof systems. Finally, we discuss connections between the problem of proving lower bounds on the size of MLPs and the problem of proving lower bounds on extended formulations of polytopes.
Permanent Link: http://hdl.handle.net/11104/0273491