On the public citation graph
On lower bounds of the closeness between complexity classes
0 signed · 21 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/bf01704904openalex-snapshot
Complete sets and closeness to complexity classes
inferredcites →https://doi.org/10.1007/bfb0028988openalex-snapshot
Complete problems and strong polynomial reducibilities
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0022-0000(89)90020-2openalex-snapshot
Probabilistic complexity classes and lowness
inferredcites →https://doi.org/10.1109/sct.1988.5278openalex-snapshot
Distinguishing bounded reducibilities by sparse sets
inferredcites →https://doi.org/10.1137/0212027openalex-snapshot
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
inferredcites →https://doi.org/10.1137/0217056openalex-snapshot
On Sets Truth-Table Reducible to Sparse Sets
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1145/100216.100276openalex-snapshot
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_96openalex-snapshot
On symmetric differences of NP-hard sets with weakly-P-selective sets
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_32openalex-snapshot
The Fault Tolerance of NP-Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_48openalex-snapshot
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
inferred← citeshttps://doi.org/10.1007/s10878-010-9327-5openalex-snapshot
Separating NE from some nonuniform nondeterministic complexity classes
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90292-2openalex-snapshot
On symmetric differences of NP-hard sets with weakly P-selective sets
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.012openalex-snapshot
The fault tolerance of NP-hard problems
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313839openalex-snapshot
Properties of NP-complete sets
inferred← citeshttps://doi.org/10.1109/sct.1992.215398openalex-snapshot
On closeness of NP-hard sets to other complexity classes
inferred← citeshttps://doi.org/10.1137/s009753970444421xopenalex-snapshot
Properties of NP‐Complete Sets
inferred← citeshttps://doi.org/10.1137/s0097539792225935openalex-snapshot
Closeness of NP-Hard Sets to Other Complexity Classes
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.