On the public citation graph

Probabilistic machines, oracles, and quantifiers

https://doi.org/10.1007/bfb0076220
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.
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.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(79)90043-4openalex-snapshot
A second step toward the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(80)90027-4openalex-snapshot
On counting problems and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(82)80019-3openalex-snapshot
Robustness of probabilistic computational complexity classes under definitional perturbations
inferredcites →https://doi.org/10.1016/s0019-9958(86)80012-2openalex-snapshot
On relativized exponential and probabilistic complexity classes
inferredcites →https://doi.org/10.1016/s0019-9958(86)80044-4openalex-snapshot
A decisive characterization of BPP
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
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.1145/322290.322306openalex-snapshot
Relativized Questions Involving Probabilistic Algorithms
inferredcites →https://doi.org/10.1145/800057.808680openalex-snapshot
Sums of divisors, perfect numbers, and factoring
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-16486-3_112openalex-snapshot
Probabilistic quantifiers, adversaries, and complexity classes : An overview
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_67openalex-snapshot
Probabilistic quantifiers vs. distrustful adversaries
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_4openalex-snapshot
Generalized Boolean hierarchies and Boolean hierarchies over RP
inferred← citeshttps://doi.org/10.1007/bf01303057openalex-snapshot
On closure properties of bounded two-sided error complexity classes
inferred← citeshttps://doi.org/10.1007/bf02088291openalex-snapshot
Generalized lowness and highness and probabilistic complexity classes
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90037-2openalex-snapshot
Probabilistic quantifiers and games
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90125-yopenalex-snapshot
A uniform approach to define complexity classes
inferred← citeshttps://doi.org/10.1109/sct.1991.160248openalex-snapshot
Complexity classes and sparse oracles
inferred← citeshttps://doi.org/10.1109/sct.1991.160261openalex-snapshot
A pseudorandom oracle characterization of BPP
inferred← citeshttps://doi.org/10.1137/0222065openalex-snapshot
A Pseudorandom Oracle Characterization of ${\text{BPP}}$
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.