Quantum separation of local search and fixed point computation
From MaRDI portal
(Redirected from Publication:848947)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485488 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- Automata, Languages and Programming
- Discrete fixed point theorem reconsidered
- Equilibrium points in n -person games
- Existence of an Equilibrium for a Competitive Economy
- Exponential lower bounds for finding Brouwer fixed points
- Fundamentals of Computation Theory
- Lower bounds for local search by quantum arguments
- Minimization algorithms and random walk on the d-cube
- New upper and lower bounds for randomized and quantum local search
- On algorithms for discrete and approximate brouwer fixed points
- On the complexity of price equilibria
- On the power of Ambainis lower bounds
- Quantum and classical query complexities of local search are polynomially related
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- The Approximation of Fixed Points of a Continuous Mapping
Cited in
(4)
This page was built for publication: Quantum separation of local search and fixed point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848947)