Almost-Everywhere Superiority for Quantum Polynomial Time.

Edith Hemaspaandra Lane A. Hemaspaandra Marius Zimand

Published in: Inf. Comput. (2002)

Keyphrases

special case
approximation algorithms
quantum computing
quantum computation
quantum inspired
computational complexity
worst case
probability ranking principle
quantum mechanics
np hardness
dnf formulae
linear programming
logic circuits
objective function
case study
decision making
real time