On the public citation graph
Complexity classes of alternating machines with oracles
0 signed · 43 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/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1007/bf01744301openalex-snapshot
On relativizing auxiliary pushdown machines
inferredcites →https://doi.org/10.1007/bfb0012797openalex-snapshot
On relativization and the existence of complete sets
inferredcites →https://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
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(78)90003-8openalex-snapshot
Log space machines with multiple oracle tapes
inferredcites →https://doi.org/10.1016/0304-3975(81)90061-xopenalex-snapshot
Bounded query machines: On NP and PSPACE
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/s0022-0000(74)80008-5openalex-snapshot
Comparing complexity classes
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
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/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1145/800070.802195openalex-snapshot
On the random oracle hypothesis
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440412openalex-snapshot
The Analytic Polynomial‐Time Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_143openalex-snapshot
On type-2 probabilistic quantifiers
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_14openalex-snapshot
Measure One Results in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_21openalex-snapshot
Complexity of Propositional Independence and Inclusion Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_3openalex-snapshot
Randomness, Tally Sets, and Complexity Classes
inferred← citeshttps://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferred← citeshttps://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferred← citeshttps://doi.org/10.1007/bfb0029618openalex-snapshot
Generalized kolmogorov complexity in relativized separations
inferred← citeshttps://doi.org/10.1007/s00153-005-0283-1openalex-snapshot
Bounded truth table does not reduce the one-query tautologies to a random oracle
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00057-7openalex-snapshot
Bounding queries in the analytic polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1109/fscs.1990.89520openalex-snapshot
Nondeterministic exponential time has two-prover interactive protocols
inferred← citeshttps://doi.org/10.1109/sct.1990.113952openalex-snapshot
E-mail and the unexpected power of interaction
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492582openalex-snapshot
Using autoreducibility to separate complexity classes
inferred← citeshttps://doi.org/10.1137/0217030openalex-snapshot
Lowness Properties of Sets in the Exponential-Time Hierarchy
inferred← citeshttps://doi.org/10.1145/3157054openalex-snapshot
Complexity of Propositional Logics in Team Semantic
inferred← citeshttps://doi.org/10.15488/16492openalex-snapshot
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic
inferred← citeshttps://doi.org/10.24033/msmf.311openalex-snapshot
The role of rudimentary relations in complexity theory
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.28openalex-snapshot
Complete Problems of Propositional Logic for the Exponential Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06135openalex-snapshot
Complexity of Propositional Logics in Team Semantics
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.