On the incompressibility of monotone DNFs
From MaRDI portal
Publication:2642913
DOI10.1007/s00224-007-2013-zzbMath1127.68036OpenAlexW2083348414MaRDI QIDQ2642913
Publication date: 6 September 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-2013-z
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Lower bounds for monotone \(q\)-multilinear Boolean circuits ⋮ Very large cliques are easy to detect ⋮ Lower bounds for tropical circuits and dynamic programs
This page was built for publication: On the incompressibility of monotone DNFs
