Quantum separation of local search and fixed point computation
From MaRDI portal
Publication:848947
DOI10.1007/s00453-009-9289-0zbMath1187.68179OpenAlexW2066150524MaRDI QIDQ848947
Shang-Hua Teng, Xi Chen, Xiaoming Sun
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9289-0
Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of Ambainis lower bounds
- Exponential lower bounds for finding Brouwer fixed points
- Minimization algorithms and random walk on the d-cube
- On the complexity of price equilibria
- Discrete fixed point theorem reconsidered
- New upper and lower bounds for randomized and quantum local search
- Lower bounds for local search by quantum arguments
- On algorithms for discrete and approximate brouwer fixed points
- Quantum lower bounds by polynomials
- Fundamentals of Computation Theory
- The Approximation of Fixed Points of a Continuous Mapping
- Automata, Languages and Programming
- Equilibrium points in n -person games
- Existence of an Equilibrium for a Competitive Economy
- Quantum lower bounds by quantum arguments
- Quantum and classical query complexities of local search are polynomially related
This page was built for publication: Quantum separation of local search and fixed point computation
