Login / Signup
The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions.
Guy Wolfovitz
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
boolean functions
uniform distribution
polynomial size
threshold functions
relevant variables
membership queries
truth table
prime implicants
functional properties
bounded treewidth
read once formulas
high speed
dnf formulae
computational complexity
machine learning
binary decision diagrams
pac learning
worst case