On the public citation graph
Graph properties and circular functions: how low can quantum query complexity go?
0 signed · 28 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/3-540-45061-0_25openalex-snapshot
Quantum Search on Bounded-Error Inputs
inferredcites →https://doi.org/10.1016/0020-0190(84)90019-xopenalex-snapshot
The critical complexity of graph properties
inferredcites →https://doi.org/10.1016/0095-8956(78)90030-8openalex-snapshot
Packings of graphs and applications to computational complexity
inferredcites →https://doi.org/10.1016/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.020openalex-snapshot
Quantum certificate complexity
inferredcites →https://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/502090.502097openalex-snapshot
Quantum lower bounds by polynomials
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11750321_32openalex-snapshot
Block Sensitivity of Weakly Symmetric Functions
inferred← citeshttps://doi.org/10.1007/s11704-007-0026-zopenalex-snapshot
Search an unsorted database with quantum mechanics
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.025openalex-snapshot
Block sensitivity of minterm-transitive functions
inferred← citeshttps://doi.org/10.1137/1.9781611976465.59openalex-snapshot
Quantum algorithms for graph problems with cut queries
inferred← citeshttps://doi.org/10.1137/110833026openalex-snapshot
Quantum Query Complexity of Minor-Closed Graph Properties
inferred← citeshttps://doi.org/10.1561/0400000055openalex-snapshot
Evasiveness of Graph Properties and Topological Fixed-Point Theorems
inferred← citeshttps://doi.org/10.1561/9781601986658openalex-snapshot
Evasiveness of Graph Properties and Topological Fixed-Point Theorems
inferred← citeshttps://doi.org/10.18725/oparu-976openalex-snapshot
Quantum complexity of graph and algebraic problems
inferred← citeshttps://doi.org/10.26421/qic18.1-2-2openalex-snapshot
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.36openalex-snapshot
Separations Between Combinatorial Measures for Transitive Functions
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.17openalex-snapshot
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry
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.stacs.2016.48openalex-snapshot
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1001.2052openalex-snapshot
Block Sensitivity of Minterm-Transitive Functions
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0509153openalex-snapshot
Lower Bounds on Quantum Query Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0510084openalex-snapshot
Quantum Complexity Bounds for Independent Set Problems
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.