Výsledky vyhledávání - "Monotone Linear Programming Circuits"

Representations of Monotone Boolean Functions by Linear Programs

Autoři: Mateus De Oliveira Oliveira Pavel Pudlák Mateus de Oliveira Oliveira and Pavel Pudlák

Přispěvatelé: Mateus De Oliveira Oliveira Pavel Pudlák Mateus de Oliveira Oliveira and Pavel Pudlák

Zdroj: ACM Transactions on Computation Theory. 11:1-31

Témata: Lower Bounds, monotone linear programming circuits, Feasible Interpolation, Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Lovász-Schrijver proof systems, feasible interpolation, 0102 computer and information sciences, ddc:004, Cutting-Planes Proof System, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7520/pdf/LIPIcs-CCC-2017-3.pdf
https://dl.acm.org/doi/10.5555/3135595.3135598
https://drops.dagstuhl.de/opus/volltexte/2017/7520/
https://dblp.uni-trier.de/db/conf/coco/coco2017.html#OliveiraP17
https://dblp.uni-trier.de/db/journals/toct/toct11.html#OliveiraP19
https://dl.acm.org/doi/10.1145/3337787
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3
http://hdl.handle.net/11104/0301620
http://hdl.handle.net/11104/0273491

Representations of Monotone Boolean Functions by Linear Programs

Autoři: de Oliveira Oliveira, Mateus Pudlák, Pavel Mateus de Oliveira Oliveira and Pavel Pudlák

Přispěvatelé: de Oliveira Oliveira, Mateus Pudlák, Pavel Mateus de Oliveira Oliveira and Pavel Pudlák

Témata: Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Cutting-Planes Proof System, Feasible Interpolation, Lower Bounds

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3

Dostupnost: https://doi.org/10.4230/LIPIcs.CCC.2017.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-75200
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3

Representations of Monotone Boolean Functions by Linear Programs

Autoři: Mateus de Oliveira Oliveira and Pavel Pudlák de Oliveira Oliveira, Mateus Pudlák, Pavel

Témata: Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Cutting-Planes Proof System, Feasible Interpolation, Lower Bounds, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3
Is Part Of LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017)