Polynomial time quantum algorithms for certain bivariate hidden polynomial problems.
Thomas DeckerPeter HøyerGábor IvanyosMiklos SanthaPublished in: Quantum Inf. Comput. (2014)
Keyphrases
- optimization problems
- computational complexity
- computational problems
- test problems
- difficult problems
- search methods
- computationally efficient
- benchmark problems
- data mining
- related problems
- practical problems
- significant improvement
- theoretical analysis
- computational cost
- worst case
- special case
- polynomial hierarchy
- computationally hard
- greedy algorithms
- distributed constraint optimization
- np hardness
- computational geometry
- problems in computer vision
- approximate solutions
- greedy algorithm