On the public citation graph

Simultaneous strong separations of probabilistic and unambiguous complexity classes

https://doi.org/10.1007/bf01368782
0 signed · 48 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.1002/malq.19860321702openalex-snapshot
Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP
inferredcites →https://doi.org/10.1007/3-540-16486-3_112openalex-snapshot
Probabilistic quantifiers, adversaries, and complexity classes : An overview
inferredcites →https://doi.org/10.1007/3-540-52846-6_73openalex-snapshot
Structural complexity theory: Recent surprises
inferredcites →https://doi.org/10.1007/978-3-642-79235-9openalex-snapshot
Structural Complexity I
inferredcites →https://doi.org/10.1007/bf02090768openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0017131openalex-snapshot
Structure of complexity classes: Separations, collapses, and completeness
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
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(91)90140-dopenalex-snapshot
Probabilistic polynomial time is closed under parity reductions
inferredcites →https://doi.org/10.1016/0020-0271(72)90029-0openalex-snapshot
Computers and artificial intelligence
inferredcites →https://doi.org/10.1016/0022-0000(89)90025-1openalex-snapshot
The strong exponential hierarchy collapses
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(88)90022-9openalex-snapshot
Complexity classes without machines: On complete languages for UP
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)90439-9openalex-snapshot
On the unique satisfiability problem
inferredcites →https://doi.org/10.1016/s0019-9958(83)80058-8openalex-snapshot
Relativizations comparing NP and exponential time
inferredcites →https://doi.org/10.1051/ita/1988220202271openalex-snapshot
Immunity and simplicity in relativizations of probabilistic complexity classes
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/psct.1987.10319270openalex-snapshot
The Strong Exponential Hierarchy Collapses
inferredcites →https://doi.org/10.1109/sct.1989.41827openalex-snapshot
On the relativized power of additional accepting paths
inferredcites →https://doi.org/10.1109/sfcs.1987.30openalex-snapshot
Generic oracles and oracle classes
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
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/0213023openalex-snapshot
Immunity, Relativizations, and Nondeterminism
inferredcites →https://doi.org/10.1137/0215035openalex-snapshot
Relativizations of Unambiguous and Random Polynomial Time Classes
inferredcites →https://doi.org/10.1137/0216042openalex-snapshot
Oracles for Deterministic Versus Alternating Classes
inferredcites →https://doi.org/10.1137/0217018openalex-snapshot
Complexity Measures for Public-Key Cryptosystems
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.1137/0218007openalex-snapshot
The Boolean Hierarchy II: Applications
inferredcites →https://doi.org/10.1142/s0129054190000151openalex-snapshot
STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP
inferredcites →https://doi.org/10.1145/146585.146609openalex-snapshot
IP = PSPACE
inferredcites →https://doi.org/10.1145/201019.201030openalex-snapshot
The isomorphism conjecture fails relative to a random oracle
inferredcites →https://doi.org/10.1145/322290.322306openalex-snapshot
Relativized Questions Involving Probabilistic Algorithms
inferredcites →https://doi.org/10.1145/73007.73022openalex-snapshot
The ismorphism conjecture fails relative to a random oracle
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.7916/d83x8frjopenalex-snapshot
On the Power of Probabilistic Polynomial Time: PNP[log] ⊆ PP

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-28520-2_5openalex-snapshot
Hierarchies Based on NP
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_72openalex-snapshot
Fault-tolerance and complexity (Extended abstract)
inferred← citeshttps://doi.org/10.1007/978-981-99-3761-5_57openalex-snapshot
A Brief Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/bf01184814openalex-snapshot
Strong Self-Reducibility Precludes Strong Immunity
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.004openalex-snapshot
Languages polylog-time reducible to dot-depth 1/2
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.03.006openalex-snapshot
Perfect correspondences between dot-depth and polynomial-time hierarchies
inferred← citeshttps://doi.org/10.1051/ita:1999100openalex-snapshot
Immunity and Simplicity for Exact Counting and Other Counting Classes
inferred← citeshttps://doi.org/10.1142/s012905419300016xopenalex-snapshot
BANISHING ROBUST TURING COMPLETENESS
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9809001openalex-snapshot
Immunity and Simplicity for Exact Counting and Other Counting 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.