On the public citation graph
Relativized polynomial hierarchies extending two levels
0 signed · 42 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.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/sfcs.1976.2openalex-snapshot
A second step toward the polynomial hierarchy
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1109/swat.1973.23openalex-snapshot
On the size of sets of computable functions
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1145/800119.803891openalex-snapshot
Comparison of polynomial-time reducibilities
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.1006/jcss.1999.1678openalex-snapshot
Undecidability Results for Low Complexity Time Classes
inferred← citeshttps://doi.org/10.1006/jcss.2001.1763openalex-snapshot
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
inferred← citeshttps://doi.org/10.1007/11537311_14openalex-snapshot
Collapsing Recursive Oracles for Relativized Polynomial Hierarchies
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_93openalex-snapshot
The boolean hierarchy: Hardware over NP
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_8openalex-snapshot
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_2openalex-snapshot
Constructing Oracles by Lower Bound Techniques for Circuits
inferred← citeshttps://doi.org/10.1007/bf01704904openalex-snapshot
Complete sets and closeness to complexity classes
inferred← citeshttps://doi.org/10.1007/bf02088009openalex-snapshot
A second step toward the strong polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1007/bfb0030286openalex-snapshot
Separating, strongly separating, and collapsing relativized complexity classes
inferred← citeshttps://doi.org/10.1007/bfb0039602openalex-snapshot
Probability one separation of the Boolean hierarchy
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00059-xopenalex-snapshot
Census techniques collapse space classes
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90023-copenalex-snapshot
Oracles for structural properties: The isomorphism problem and public-key cryptography
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90011-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90085-4openalex-snapshot
On some natural complete operators
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90232-5openalex-snapshot
Strong separations of the polynomial hierarchy with oracles: constructive separations by immune and simple sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80058-8openalex-snapshot
Relativizations comparing NP and exponential time
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80012-2openalex-snapshot
On relativized exponential and probabilistic complexity classes
inferred← citeshttps://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferred← citeshttps://doi.org/10.1109/ccc.2000.856746openalex-snapshot
Easiness assumptions and hardness tests: trading time for zero error
inferred← citeshttps://doi.org/10.1109/ccc.2001.933869openalex-snapshot
Comparing notions of full derandomization
inferred← citeshttps://doi.org/10.1109/sct.1989.41809openalex-snapshot
Oracles for structural properties: the isomorphism problem and public-key cryptography
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715929openalex-snapshot
Sparse Oracles And Uniform Complexity Classes
inferred← citeshttps://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferred← citeshttps://doi.org/10.1137/0218027openalex-snapshot
Relativized Polynomial Time Hierarchies Having Exactly K Levels
inferred← citeshttps://doi.org/10.1142/s0129054105003200openalex-snapshot
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
inferred← citeshttps://doi.org/10.1145/276698.276737openalex-snapshot
NP might not be as easy as detecting unique solutions
inferred← citeshttps://doi.org/10.1145/5925.5938openalex-snapshot
Relativizing complexity classes with sparse oracles
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.