Representations of Monotone Boolean Functions by Linear Programs
From MaRDI portal
Publication:5205818
DOI10.1145/3337787zbMath1440.68077OpenAlexW2963526079MaRDI QIDQ5205818
Mateus de Oliveira Oliveira, Pavel Pudlák
Publication date: 16 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7520/
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items