Complexity of Promise Problems on Classical and Quantum Automata.

Maria Paola Bianchi Carlo Mereghetti Beatrice Palano

Published in: Computing with New Resources (2014)

Keyphrases

decision problems
problems involving
optimization problems
solving problems
np hardness
databases
machine learning
objective function
lower bound
np hard
markov decision processes
benchmark problems
polynomial hierarchy