Size lower bounds for quantum automata.
Maria Paola BianchiCarlo MereghettiBeatrice PalanoPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- computational complexity
- branch and bound algorithm
- lower and upper bounds
- running times
- quantum computing
- constant factor
- cellular automata
- quantum inspired
- neural network
- lower bounding
- finite automata
- finite state
- worst case
- query language
- np hard
- search algorithm
- reinforcement learning
- information retrieval