On the public citation graph
Query order in the polynomial hierarchy
0 signed · 44 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.1006/inco.1996.0001openalex-snapshot
PP Is Closed under Truth-Table Reductions
inferredcites →https://doi.org/10.1006/jcss.1995.1030openalex-snapshot
Complexity Classes and Sparse Oracles
inferredcites →https://doi.org/10.1007/3-540-57785-8_161openalex-snapshot
Two refinements of the polynomial hierarchy
inferredcites →https://doi.org/10.1007/3-540-62034-6_60openalex-snapshot
Pinpointing computation with modular queries in the Boolean hierarchy
inferredcites →https://doi.org/10.1007/3-540-62592-5_60openalex-snapshot
R1−tt SN (NP) distinguishes robust many-one and Turing completeness
inferredcites →https://doi.org/10.1007/bf01371729openalex-snapshot
A relationship between difference hierarchies and relativized polynomial hierarchies
inferredcites →https://doi.org/10.1007/bf01744288openalex-snapshot
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
inferredcites →https://doi.org/10.1007/bfb0023469openalex-snapshot
A downward translation in the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(94)90123-6openalex-snapshot
Upward separation for FewP and related classes
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
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(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(92)90125-yopenalex-snapshot
A uniform approach to define complexity classes
inferredcites →https://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferredcites →https://doi.org/10.1109/ccc.1997.612317openalex-snapshot
Acceptance by transformation monoids (with an application to local self reductions)
inferredcites →https://doi.org/10.1109/sct.1991.160239openalex-snapshot
PP is closed under truth-table reductions
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.1137/0217080openalex-snapshot
The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
inferredcites →https://doi.org/10.1137/s0097539790178069openalex-snapshot
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
inferredcites →https://doi.org/10.1137/s0097539796306474openalex-snapshot
A Downward Collapse within the Polynomial Hierarchy
inferredcites →https://doi.org/10.1145/300307.300308openalex-snapshot
What's up with downward collapse
inferredcites →https://doi.org/10.2307/2584070openalex-snapshot
Introduction to the Theory of Complexity.
inferredcites →https://doi.org/10.48550/arxiv.cs/9910004openalex-snapshot
An Introduction to Query Order
inferredcites →https://doi.org/10.48550/arxiv.cs/9910008openalex-snapshot
Translating Equality Downwards
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.2001.1815openalex-snapshot
Reducing the Number of Solutions of NP Functions
inferred← citeshttps://doi.org/10.1007/11533719_90openalex-snapshot
Query-Monotonic Turing Reductions
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_60openalex-snapshot
R1−tt SN (NP) distinguishes robust many-one and Turing completeness
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_19openalex-snapshot
Lower Bounds and the Hardness of Counting Properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.004openalex-snapshot
Lower bounds and the hardness of counting properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.014openalex-snapshot
Query-monotonic Turing reductions
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00024-6openalex-snapshot
A note on parallel queries and the symmetric-difference hierarchy
inferred← citeshttps://doi.org/10.1109/ccc.1997.612317openalex-snapshot
Acceptance by transformation monoids (with an application to local self reductions)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9808002openalex-snapshot
Downward Collapse from a Weaker Hypothesis
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910004openalex-snapshot
An Introduction to Query Order
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.