On the public citation graph

On the Quantum Query Complexity of Local Search in Two and Three Dimensions

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferredcites →https://doi.org/10.1007/11537311_22openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_102openalex-snapshot
On the Power of Ambainis’s Lower Bounds
inferredcites →https://doi.org/10.1007/bf02018403openalex-snapshot
Estimates for the concentration function of combinatorial number theory and probability
inferredcites →https://doi.org/10.1007/bf02392223openalex-snapshot
Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law
inferredcites →https://doi.org/10.1007/bf02566968openalex-snapshot
Theorems in the additive theory of numbers
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0166-218x(89)90025-5openalex-snapshot
Local optimization on graphs
inferredcites →https://doi.org/10.1016/j.ipl.2005.11.004openalex-snapshot
Enhanced algorithms for Local Search
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferredcites →https://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1137/s0097539704447237openalex-snapshot
Lower Bounds for Local Search by Quantum Arguments
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/1007352.1007427openalex-snapshot
Quantum and classical query complexities of local search are polynomially related
inferredcites →https://doi.org/10.1145/1060590.1060638openalex-snapshot
On algorithms for discrete and approximate brouwer fixed points
inferredcites →https://doi.org/10.1145/1132516.1132605openalex-snapshot
New upper and lower bounds for randomized and quantum local search
inferredcites →https://doi.org/10.1214/aop/1176993605openalex-snapshot
Minimization Algorithms and Random Walk on the $d$-Cube
inferredcites →https://doi.org/10.4064/aa-11-2-205-208openalex-snapshot
Über ein Problem von Erdös und Moser

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_18openalex-snapshot
Quantum Separation of Local Search and Fixed Point Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_31openalex-snapshot
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9169-zopenalex-snapshot
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
inferred← citeshttps://doi.org/10.1007/s00453-009-9289-0openalex-snapshot
Quantum Separation of Local Search and Fixed Point Computation
inferred← citeshttps://doi.org/10.1007/s11704-007-0026-zopenalex-snapshot
Search an unsorted database with quantum mechanics
inferred← citeshttps://doi.org/10.1109/focs.2007.14openalex-snapshot
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
inferred← citeshttps://doi.org/10.1109/focs.2007.53openalex-snapshot
Parameterized Proof Complexity
inferred← citeshttps://doi.org/10.1360/n112016-00084openalex-snapshot
A survey on quantum computing
inferred← citeshttps://doi.org/10.26421/qic10.7-8-5openalex-snapshot
Quantum and randomized lower bounds for local search on vertex-transitive graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702088openalex-snapshot
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.