Login / Signup
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions.
Farid M. Ablayev
Airat Khasianov
Alexander Vasiliev
Published in:
Electron. Colloquium Comput. Complex. (2008)
Keyphrases
</>
boolean functions
uniform distribution
dnf formulae
polynomial size
prime implicants
computational complexity
functional properties
relevant variables
threshold functions
worst case
membership queries
dnf formulas
disjunctive normal form
bi decomposition
multi valued
linear threshold