On the public citation graph
A Pseudorandom Oracle Characterization of ${\text{BPP}}$
0 signed · 39 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.1007/3-540-16486-3_87openalex-snapshot
Randomness, relativizations, and polynomial reducibilities
inferredcites →https://doi.org/10.1007/3-540-18625-5_67openalex-snapshot
Probabilistic quantifiers vs. distrustful adversaries
inferredcites →https://doi.org/10.1007/3-540-50517-2_81openalex-snapshot
Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes
inferredcites →https://doi.org/10.1007/bf03018295openalex-snapshot
La tendenza ad un limite nel senso del calcolo delle probabilità
inferredcites →https://doi.org/10.1007/bf03019651openalex-snapshot
Les probabilités dénombrables et leurs applications arithmétiques
inferredcites →https://doi.org/10.1007/bfb0076220openalex-snapshot
Probabilistic machines, oracles, and quantifiers
inferredcites →https://doi.org/10.1016/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1016/0022-0000(85)90040-6openalex-snapshot
Relativized circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(88)90037-2openalex-snapshot
Probabilistic quantifiers and games
inferredcites →https://doi.org/10.1016/0022-0000(90)90023-eopenalex-snapshot
Pseudorandom sources for BPP
inferredcites →https://doi.org/10.1016/0022-0000(92)90020-jopenalex-snapshot
Almost everywhere high nonuniform complexity
inferredcites →https://doi.org/10.1016/0196-8858(87)90010-8openalex-snapshot
Incompleteness theorems for random reals
inferredcites →https://doi.org/10.1016/0304-3975(91)90314-ropenalex-snapshot
Polynomial-time reducibilities and “almost all” oracle sets
inferredcites →https://doi.org/10.1016/0304-3975(93)90256-sopenalex-snapshot
Circuit size relative to pseudorandom oracles
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0019-9958(86)80044-4openalex-snapshot
A decisive characterization of BPP
inferredcites →https://doi.org/10.1016/s0022-0000(73)80030-3openalex-snapshot
Process complexity and effective random tests
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferredcites →https://doi.org/10.1137/0218031openalex-snapshot
On Tally Relativizations of $BP$-Complexity Classes
inferredcites →https://doi.org/10.1137/0219076openalex-snapshot
Category and Measure in Complexity Classes
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.7551/mitpress/7052.001.0001openalex-snapshot
Using Hard Problems to Create Pseudorandom Generators
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_41openalex-snapshot
Dimension Characterizations of Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_29openalex-snapshot
On the Autoreducibility of Random Sequences
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_255openalex-snapshot
Relativizing complexity classes with Random Oracles
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_8openalex-snapshot
Observations on measure and lowness for Δ 2 P
inferred← citeshttps://doi.org/10.1007/bf02679469openalex-snapshot
Observations on measure and lowness for Δ 2 P
inferred← citeshttps://doi.org/10.1007/bfb0058034openalex-snapshot
On resource-bounded measure and pseudorandomness
inferred← citeshttps://doi.org/10.1007/s00224-007-9024-7openalex-snapshot
Dimension Extractors and Optimal Decompression
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90317-9openalex-snapshot
On independent random oracles
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90256-sopenalex-snapshot
Circuit size relative to pseudorandom oracles
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00164-4openalex-snapshot
On pseudorandomness and resource-bounded measure
inferred← citeshttps://doi.org/10.1109/sct.1993.336530openalex-snapshot
The quantitative structure of exponential time
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365713openalex-snapshot
Measure on small complexity classes, with applications for BPP
inferred← citeshttps://doi.org/10.1137/s0097539702415317openalex-snapshot
On the Autoreducibility of Random Sequences
inferred← citeshttps://doi.org/10.31274/etd-180810-2503openalex-snapshot
Fractals in complexity and geometry
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.