A Quantum Time-Space Lower Bound for the Counting Hierarchy.

Dieter van Melkebeek Thomas Watson

Published in: Electron. Colloquium Comput. Complex. (2008)

Keyphrases

lower bound
upper bound
branch and bound
worst case
sufficiently accurate
branch and bound algorithm
np hard
objective function
computational complexity
low dimensional
real time
dynamic programming
optimal solution
linear programming
higher level
space time
image sequences
quantum computing