On DNF approximators for monotone Boolean functions

DOI10.1007/978-3-662-43948-7_20MaRDI QIDQ5167745zbMATH OpenOpenAlexWikidataFDO

Authors Eric Blais, Li-Yang Tan, Johan Hastad, Rocco A. Servedio

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation by DNF: Examples and Counterexamples
• Approximating Boolean functions with depth-2 circuits
• On deterministic approximation of DNF
• On the Fourier spectrum of monotone functions
• Mathematical Foundations of Computer Science 2005

Cited in

(6)

• scientific article; zbMATH DE number 4177135 (Why is no real title available?)
• Approximating Boolean functions with depth-2 circuits
• DNF sparsification beyond sunflowers
• Approximation by DNF: Examples and Counterexamples
• On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
• Mathematical Foundations of Computer Science 2005

This page was built for publication: On DNF approximators for monotone Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167745)