Login / Signup
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis.
Heribert Vollmer
Published in:
Theory Comput. Syst. (2009)
Keyphrases
</>
boolean functions
uniform distribution
truth table
polynomial size
relevant variables
functional properties
high speed
bi decomposition
pseudo boolean functions
bayesian networks
multi valued
stack filters