On the public citation graph
Oracles Are Subtle But Not Malicious
0 signed · 66 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.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1006/jcss.1996.0032openalex-snapshot
Oracles and Queries That Are Sufficient for Exact Learning
inferredcites →https://doi.org/10.1006/jcss.1999.1651openalex-snapshot
Complexity Limitations on Quantum Computation
inferredcites →https://doi.org/10.1007/3-540-48686-0_21openalex-snapshot
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
inferredcites →https://doi.org/10.1007/bf01111276openalex-snapshot
Schwankung von Polynomen zwischen Gitterpunkten
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01215346openalex-snapshot
The expressive power of voting polynomials
inferredcites →https://doi.org/10.1007/bf01263419openalex-snapshot
On the degree of boolean functions as real polynomials
inferredcites →https://doi.org/10.1007/bf01263422openalex-snapshot
Perceptrons, PP, and the polynomial hierarchy
inferredcites →https://doi.org/10.1007/s00037-001-8190-2openalex-snapshot
Two oracles that force a big crunch
inferredcites →https://doi.org/10.1007/s00037-007-0218-9openalex-snapshot
Pseudorandomness for Approximate Counting and Sampling
inferredcites →https://doi.org/10.1016/0020-0190(83)90044-3openalex-snapshot
BPP and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(88)90199-8openalex-snapshot
Are there interactive protocols for co-NP languages?
inferredcites →https://doi.org/10.1016/0022-0000(85)90040-6openalex-snapshot
Relativized circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/j.ipl.2004.02.005openalex-snapshot
Polynomial time quantum computation with advice
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.032openalex-snapshot
A note on the circuit complexity of PP
inferredcites →https://doi.org/10.1016/s0019-9958(82)90382-5openalex-snapshot
Circuit-size lower bounds and non-reducibility to sparse sets
inferredcites →https://doi.org/10.1098/rspa.2005.1546openalex-snapshot
Quantum computing, postselection, and probabilistic polynomial-time
inferredcites →https://doi.org/10.1109/sct.1995.514853openalex-snapshot
A personal view of average-case complexity
inferredcites →https://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1137/0703024openalex-snapshot
A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
inferredcites →https://doi.org/10.1137/s0097539700389652openalex-snapshot
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1137/s0097539792240467openalex-snapshot
Threshold Computation and Cryptographic Security
inferredcites →https://doi.org/10.1137/s0097539795296206openalex-snapshot
New Collapse Consequences of NP Having Small Circuits
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/602220.602223openalex-snapshot
Cosmological lower bound on the circuit complexity of a small problem in logic
inferredcites →https://doi.org/10.1145/800061.808740openalex-snapshot
The complexity of approximate counting
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferredcites →https://doi.org/10.26421/qic3.1-7openalex-snapshot
Both Toffoli and Controlled-NOT need little help to universal quantum computing
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-1-4939-2864-4_193openalex-snapshot
Learning with the Aid of an Oracle
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_29openalex-snapshot
On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_193-2openalex-snapshot
Learning with the Aid of an Oracle (1996; Bshouty, Cleve, Gavaldà, Kannan, Tamon)
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_36openalex-snapshot
On TC0 Lower Bounds for the Permanent
inferred← citeshttps://doi.org/10.1007/s00453-013-9823-yopenalex-snapshot
Lower Bounds Against Weakly-Uniform Threshold Circuits
inferred← citeshttps://doi.org/10.1109/ccc.2009.21openalex-snapshot
Fixed-Polynomial Size Circuit Bounds
inferred← citeshttps://doi.org/10.1109/focs.2008.91openalex-snapshot
The Polynomial Method in Quantum and Classical Computing
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00009openalex-snapshot
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043205openalex-snapshot
Trade-offs in Cryptosystems by Boolean and Quantum Circuits
inferred← citeshttps://doi.org/10.1145/1250790.1250832openalex-snapshot
Circuit lower bounds for Merlin-Arthur classes
inferred← citeshttps://doi.org/10.1145/1806689.1806710openalex-snapshot
A full characterization of quantum advice
inferred← citeshttps://doi.org/10.1145/3618260.3649624openalex-snapshot
Symmetric Exponential Time Requires Near-Maximum Circuit Size
inferred← citeshttps://doi.org/10.1145/3717823.3718145openalex-snapshot
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P Hardness
inferred← citeshttps://doi.org/10.1145/3778166openalex-snapshot
Symmetric Exponential Time Requires Near-Maximum Circuit Size
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.407openalex-snapshot
Quantum Computation with Supplementary Information
inferred← citeshttps://doi.org/10.2200/s00159ed1v01y200810qmc002openalex-snapshot
Quantum Computer Science
inferred← citeshttps://doi.org/10.4036/iis.2014.1openalex-snapshot
Proving Circuit Lower Bounds in High Uniform Classes
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.