Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem.
Airat KhasianovPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- lower and upper bounds
- boolean functions
- worst case
- lower bounding
- quantum mechanics
- deterministic finite automaton
- probability ranking principle
- set of randomly generated instances
- quantum inspired
- quantum computing
- quadratic assignment problem
- linear programming relaxation
- knowledge compilation
- upper and lower bounds
- vc dimension
- learning theory
- model checking
- special case
- evolutionary algorithm