On the public citation graph
https://doi.org/10.4086/toc.2006.v002a001
0 signed · 107 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.
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.
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/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1016/0024-3795(90)90403-yopenalex-snapshot
The spectral norm of a nonnegative matrix
inferredcites →https://doi.org/10.1016/0304-3975(85)90210-5openalex-snapshot
Lower bounds on probabilistic linear decision trees
inferredcites →https://doi.org/10.1016/0378-4754(89)90164-xopenalex-snapshot
Linear algebra and its applications
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/ccc.2004.1313852openalex-snapshot
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
inferredcites →https://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0310107openalex-snapshot
On the Quantum Query Complexity of Detecting Triangles in Graphs
inferredcites →https://doi.org/10.5555/1070432.1070591openalex-snapshot
Quantum algorithms for the triangle problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537311_22openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1007/978-3-031-52213-0_5openalex-snapshot
On Query Complexity Measures and Their Relations for Symmetric Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_71openalex-snapshot
Optimal Quantum Adversary Lower Bounds for Ordered Search
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_29openalex-snapshot
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_10openalex-snapshot
Quantum Counterfeit Coin Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_34openalex-snapshot
Reconstructing Strings from Substrings with Quantum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-54429-3_6openalex-snapshot
Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
inferred← citeshttps://doi.org/10.1007/s00037-014-0084-1openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1007/s00037-015-0099-2openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
inferred← citeshttps://doi.org/10.1007/s00224-008-9121-2openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1007/s00453-007-9022-9openalex-snapshot
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
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/s11128-011-0233-2openalex-snapshot
Optimality proofs of quantum weight decision algorithms
inferred← citeshttps://doi.org/10.1007/s11128-019-2297-3openalex-snapshot
Evaluation of exact quantum query complexities by semidefinite programming
inferred← citeshttps://doi.org/10.1016/b978-0-44-327704-7.00012-8openalex-snapshot
Quantum computational complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.039openalex-snapshot
Quantum counterfeit coin problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.006openalex-snapshot
Quantum algorithms for finding constant-sized sub-hypergraphs
inferred← citeshttps://doi.org/10.1063/1.2198820openalex-snapshot
Effects of electric fields on proton transport through water chains
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1109/ccc.2008.9openalex-snapshot
The Multiplicative Quantum Adversary
inferred← citeshttps://doi.org/10.1109/ccc.2010.31openalex-snapshot
The Partition Bound for Classical Communication Complexity and Query Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2011.24openalex-snapshot
Symmetry-Assisted Adversaries for Quantum State Generation
inferred← citeshttps://doi.org/10.1109/ccc.2013.14openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1109/ccc.2014.11openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound
inferred← citeshttps://doi.org/10.1109/focs.2009.55openalex-snapshot
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
inferred← citeshttps://doi.org/10.1134/s1064226909090022openalex-snapshot
Focusing of the field of a cylindrical wave by modify ideal Veselago lens
inferred← citeshttps://doi.org/10.1134/s106422691209001xopenalex-snapshot
The resonance properties of the near field in finite thin Veselago and Pendry lenses
inferred← citeshttps://doi.org/10.1134/s1064226912110010openalex-snapshot
Two-frequency resonance scattering by finite thin metamaterial plates
inferred← citeshttps://doi.org/10.1134/s1064226913020010openalex-snapshot
Diffraction of plane and cylindrical waves by a cylindrical metamaterial shell with a negative refractive index
inferred← citeshttps://doi.org/10.1134/s1064226913040037openalex-snapshot
The wave theory of infinite and finite Veselago lenses
inferred← citeshttps://doi.org/10.1134/s1064226919100012openalex-snapshot
On Plasmon Resonances of a Finite Plate Made from a Metamaterial
inferred← citeshttps://doi.org/10.1137/050639090openalex-snapshot
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
inferred← citeshttps://doi.org/10.1137/06066775xopenalex-snapshot
Tight Bounds for Randomized and Quantum Local Search
inferred← citeshttps://doi.org/10.1137/1.9781611973082.44openalex-snapshot
Reflections for quantum query algorithms
inferred← citeshttps://doi.org/10.1137/100792640openalex-snapshot
Span Programs are Equivalent to Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1137/110833026openalex-snapshot
Quantum Query Complexity of Minor-Closed Graph Properties
inferred← citeshttps://doi.org/10.1137/24m1638616openalex-snapshot
Quantum Lower Bounds by Sample-to-Query Lifting
inferred← citeshttps://doi.org/10.1142/s0219749913500597openalex-snapshot
Explicit relation between all lower bound techniques for quantum query complexity
inferred← citeshttps://doi.org/10.1145/1132516.1132604openalex-snapshot
A new quantum lower bound method,
inferred← citeshttps://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferred← citeshttps://doi.org/10.1145/1374376.1374394openalex-snapshot
Span-program-based quantum algorithm for evaluating formulas
inferred← citeshttps://doi.org/10.1145/2422436.2422474openalex-snapshot
Adversary lower bound for the k-sum problem
inferred← citeshttps://doi.org/10.1145/2897518.2897644openalex-snapshot
Separations in query complexity using cheat sheets
inferred← citeshttps://doi.org/10.1145/3188745.3188784openalex-snapshot
The polynomial method strikes back: tight quantum query bounds via dual polynomials
inferred← citeshttps://doi.org/10.1145/3406325.3451047openalex-snapshot
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
inferred← citeshttps://doi.org/10.1145/3442357openalex-snapshot
All Classical Adversary Methods Are Equivalent for Total Functions
inferred← citeshttps://doi.org/10.1145/3618260.3649700openalex-snapshot
Quantum Time-Space Tradeoffs for Matrix Problems
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1008openalex-snapshot
NPN-Representatives of a Set of Optimal Boolean Formulas
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.280openalex-snapshot
Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
inferred← citeshttps://doi.org/10.18725/oparu-976openalex-snapshot
Quantum complexity of graph and algebraic problems
inferred← citeshttps://doi.org/10.22331/q-2021-11-24-587openalex-snapshot
Two new results about quantum exact learning
inferred← citeshttps://doi.org/10.26421/qic10.3-4openalex-snapshot
The quantum query complexity of certification
inferred← citeshttps://doi.org/10.26421/qic10.3-4-1openalex-snapshot
The quantum query complexity of certification
inferred← citeshttps://doi.org/10.26421/qic12.7-8-11openalex-snapshot
The quantum query complexity of AC0
inferred← citeshttps://doi.org/10.26421/qic14.5-6-4openalex-snapshot
Quantum algorithms for search with wildcards and combinatorial group testing
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.4openalex-snapshot
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.36openalex-snapshot
On the Pseudo-Deterministic Query Complexity of NP Search Problems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.661openalex-snapshot
Quantum query complexity of minor-closed graph properties
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2024.11openalex-snapshot
A Direct Reduction from the Polynomial to the Adversary Method
inferred← citeshttps://doi.org/10.48550/arxiv.1304.0845openalex-snapshot
Adversary Lower Bound for the Orthogonal Array Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2035openalex-snapshot
A Survey of Quantum Property Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3858openalex-snapshot
Applications of the Adversary Method in Quantum Query Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07261openalex-snapshot
Dual Polynomials for Collision and Element Distinctness
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06943openalex-snapshot
Variations on Quantum Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01210openalex-snapshot
Nearly optimal separations between communication (or query) complexity and partitions
inferred← citeshttps://doi.org/10.48550/arxiv.1801.08967openalex-snapshot
Oracle Separations for Quantum Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03315openalex-snapshot
A Quantum Algorithm for Finding $k$-Minima
inferred← citeshttps://doi.org/10.48550/arxiv.1910.04555openalex-snapshot
Lower Bounds for Parallel Quantum Counting
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06439openalex-snapshot
The quantum query complexity of composition with a relation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0509067openalex-snapshot
Tight adversary bounds for composite functions
inferred← citeshttps://doi.org/10.7282/t3b27tmjopenalex-snapshot
Application of SDP to product rules and quantum query complexity
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.