On the Lower Bounds for One-Way Quantum Automata.
Farid M. AblayevAida GainutdinovaPublished in: MFCS (2000)
Keyphrases
- lower bound
- upper bound
- finite automata
- quantum computation
- branch and bound algorithm
- np hard
- probabilistic automata
- branch and bound
- quantum computing
- objective function
- worst case
- cellular automata
- quadratic assignment problem
- finite state
- lower and upper bounds
- finite state machines
- regular expressions
- optimal solution
- upper and lower bounds
- randomly generated problems
- quantum inspired
- probability ranking principle
- max sat
- linear programming relaxation
- tree automata
- linear programming
- set of randomly generated instances
- vc dimension
- evolutionary algorithm