On the public citation graph
Completeness for nondeterministic complexity classes
0 signed · 49 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-16486-3_107openalex-snapshot
Optimal approximations of complete sets
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1007/bfb0028988openalex-snapshot
Complete problems and strong polynomial reducibilities
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(78)90018-xopenalex-snapshot
On log-tape isomorphisms of complete sets
inferredcites →https://doi.org/10.1016/0304-3975(87)90132-0openalex-snapshot
A comparison of polynomial time completeness notions
inferredcites →https://doi.org/10.1016/s0022-0000(75)80050-xopenalex-snapshot
Space-bounded reducibility among combinatorial problems
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
inferredcites →https://doi.org/10.1109/sfcs.1976.22openalex-snapshot
On the structure of complete sets: Almost everywhere complexity and infinitely often speedup
inferredcites →https://doi.org/10.1137/0201022openalex-snapshot
A Minimum Distance Error-Correcting Parser for Context-Free Languages
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/1.9781611970395openalex-snapshot
Feasible Computations and Provable Complexity Properties
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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.1996.0065openalex-snapshot
Relative to a Random Oracle, NP Is Not Small
inferred← citeshttps://doi.org/10.1007/11786986_41openalex-snapshot
Comparing Reductions to NP-Complete Sets
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_150openalex-snapshot
Collapsing degrees via strong computation
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_20openalex-snapshot
Splittings, robustness and structure of complete sets
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_159openalex-snapshot
Cook versus Karp-Levin: Separating completeness notions if NP is not small
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_10openalex-snapshot
The Quantitative Structure of Exponential Time
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_6openalex-snapshot
Structural Properties of Complete Problems for Exponential Time
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_5openalex-snapshot
Introduction to Autoreducibility and Mitoticity
inferred← citeshttps://doi.org/10.1007/978-3-662-22110-5_2openalex-snapshot
Complete Sets and Structure in Subrecursive Classes
inferred← citeshttps://doi.org/10.1007/bf01271369openalex-snapshot
The relative power of logspace and polynomial time reductions
inferred← citeshttps://doi.org/10.1007/bfb0055797openalex-snapshot
Positive turing and truth-table completeness for NEXP are incomparable
inferred← citeshttps://doi.org/10.1007/s00224-007-9000-2openalex-snapshot
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
inferred← citeshttps://doi.org/10.1007/s00224-011-9365-0openalex-snapshot
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90009-lopenalex-snapshot
Collapsing degrees via strong computation
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90125-dopenalex-snapshot
Exponential-time and subexponential-time sets
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00189-1openalex-snapshot
Cook versus Karp-Levin: Separating completeness notions if NP is not small
inferred← citeshttps://doi.org/10.1017/9781316716816.003openalex-snapshot
Complete Sets and Structure in Subrecursive Classes
inferred← citeshttps://doi.org/10.1109/ccc.2001.933875openalex-snapshot
Separation of NP-completeness notions
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313842openalex-snapshot
Partial Bi-immunity and NP-completeness
inferred← citeshttps://doi.org/10.1109/ccc.2004.23openalex-snapshot
Partial bi-immunity and NP-completeness
inferred← citeshttps://doi.org/10.1109/sct.1993.336525openalex-snapshot
SPARSE reduces conjunctively to TALLY
inferred← citeshttps://doi.org/10.1109/sct.1993.336530openalex-snapshot
The quantitative structure of exponential time
inferred← citeshttps://doi.org/10.1109/sct.1994.315807openalex-snapshot
Relative to a random oracle, NP is not small
inferred← citeshttps://doi.org/10.1109/sct.1994.315811openalex-snapshot
On the structure of complete sets
inferred← citeshttps://doi.org/10.1137/s0097539795279724openalex-snapshot
Splittings, Robustness, and Structure of Complete Sets
inferred← citeshttps://doi.org/10.1142/9781848162778_0002openalex-snapshot
The Isomorphism Conjecture for NP
inferred← citeshttps://doi.org/10.1145/2898440openalex-snapshot
Structural Properties of Nonautoreducible Sets
inferred← citeshttps://doi.org/10.1145/882116.882125openalex-snapshot
SIGACT news complexity theory column 40
inferred← citeshttps://doi.org/10.31274/etd-180810-4556openalex-snapshot
Randomness in completeness and space-bounded computations
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2462openalex-snapshot
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.590openalex-snapshot
Non-autoreducible Sets for NEXP
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0117openalex-snapshot
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
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.