0477105 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel - de Oliveira Oliveira, MateusRepresentations 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
Permanent Link: http://hdl.handle.net/11104/0273491
