Login / Signup
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.
Beate Bollig
Martin Sauerhoff
Ingo Wegener
Published in:
Computational Complexity Conference (2001)
Keyphrases
</>
boolean functions
uniform distribution
randomly generated
dnf formulae
threshold functions
functional properties
relevant variables
prime implicants
membership queries
multi valued
logic programs
linear threshold
pac learning
read once formulas