On the public citation graph
Structure of complexity classes: Separations, collapses, and completeness
0 signed · 64 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-08342-1_37openalex-snapshot
On the difference between one and many
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-16486-3_85openalex-snapshot
The complexity of sparse sets in P
inferredcites →https://doi.org/10.1007/3-540-16486-3_93openalex-snapshot
The boolean hierarchy: Hardware over NP
inferredcites →https://doi.org/10.1007/3-540-16761-7_62openalex-snapshot
Complexity classes without machines: On complete languages for UP
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bf02125350openalex-snapshot
Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0012797openalex-snapshot
On relativization and the existence of complete sets
inferredcites →https://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0030318openalex-snapshot
Some connections between presentability of complexity classes and the power of formal systems of reasoning
inferredcites →https://doi.org/10.1007/bfb0035835openalex-snapshot
Collapsing oracle hierarchies, census functions and logarithmically many queries
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
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(86)90078-5openalex-snapshot
A note on complete problems for complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(82)90002-2openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
inferredcites →https://doi.org/10.1016/0022-0000(82)90050-2openalex-snapshot
A note on sparse oracles for NP
inferredcites →https://doi.org/10.1016/0022-0000(83)90027-2openalex-snapshot
A low and a high hierarchy within NP
inferredcites →https://doi.org/10.1016/0022-0000(87)90009-2openalex-snapshot
Σ2 SPACE(n) is closed under complement
inferredcites →https://doi.org/10.1016/0022-0000(89)90024-xopenalex-snapshot
PNP[(log )] and sparse turing-complete sets for NP
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(85)90158-6openalex-snapshot
Robust algorithms: A different approach to oracles
inferredcites →https://doi.org/10.1016/0304-3975(86)90141-6openalex-snapshot
Some observations on the connection between counting and recursion
inferredcites →https://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferredcites →https://doi.org/10.1109/psct.1987.10319250openalex-snapshot
Polynomial Terse Sets (Extended Abstract)
inferredcites →https://doi.org/10.1109/psct.1987.10319252openalex-snapshot
P NP [log n] and Sparse Turing-Complete Sets for NP
inferredcites →https://doi.org/10.1109/psct.1987.10319267openalex-snapshot
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
inferredcites →https://doi.org/10.1109/sct.1988.5271openalex-snapshot
Two applications of complementation via inductive counting
inferredcites →https://doi.org/10.1109/sct.1988.5284openalex-snapshot
Relativized polynomial time hierarchies having exactly K levels
inferredcites →https://doi.org/10.1109/sfcs.1984.715952openalex-snapshot
Complexity Measures For Public-Key Cryptosystems
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1986.56openalex-snapshot
Three results on the polynomial isomorphism of complete sets
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/0206023openalex-snapshot
On Isomorphisms and Density of $NP$ and Other Complete Sets
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
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.1145/12130.12133openalex-snapshot
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
inferredcites →https://doi.org/10.1145/28395.28408openalex-snapshot
The strong exponential hierarchy collapses
inferredcites →https://doi.org/10.1145/62212.62235openalex-snapshot
Relativized polynomial time hierarchies having exactly K levels
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
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-3-540-31856-9_15openalex-snapshot
On the Computational Complexity of the Forcing Chromatic Number
inferred← citeshttps://doi.org/10.1007/bf01368782openalex-snapshot
Simultaneous strong separations of probabilistic and unambiguous complexity classes
inferred← citeshttps://doi.org/10.1007/bf02090768openalex-snapshot
On the power of parity polynomial time
inferred← citeshttps://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90038-mopenalex-snapshot
On the complexity of ranking
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90138-8openalex-snapshot
Robust machines accept easy sets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90282-7openalex-snapshot
Kolmogorov characterizations of complexity classes
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90125-yopenalex-snapshot
A uniform approach to define complexity classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1109/sct.1990.113976openalex-snapshot
A note on relativizing complexity classes with tally
inferred← citeshttps://doi.org/10.1137/050641594openalex-snapshot
On the Computational Complexity of the Forcing Chromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0406044openalex-snapshot
On the Computational Complexity of the Forcing Chromatic Number
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.