On the public citation graph
An essay about research on sparse NP complete sets
0 signed · 25 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-08138-0_1openalex-snapshot
On polynomial time isomorphisms of complete sets
inferredcites →https://doi.org/10.1007/3-540-08860-1_6openalex-snapshot
Relationship between density and deterministic complexity of MP-complete languages
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01768464openalex-snapshot
Inclusion complete tally languages and the Hartmanis-Berman conjecture
inferredcites →https://doi.org/10.1016/0022-0000(78)90027-2openalex-snapshot
On polynomial time isomorphisms of some new complete sets
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(81)90069-4openalex-snapshot
On the structure of sets in NP and other complexity classes
inferredcites →https://doi.org/10.1109/sfcs.1980.40openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
inferredcites →https://doi.org/10.1137/0206023openalex-snapshot
On Isomorphisms and Density of $NP$ and Other Complete Sets
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
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.1007/3-540-28520-2_3openalex-snapshot
Foundations of Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_4openalex-snapshot
Juris Hartmanis: Fundamental Contributions to Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_19openalex-snapshot
Computational Complexity of Synchronization Under Sparse Regular Constraints
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90002-2openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
inferred← citeshttps://doi.org/10.1137/0221034openalex-snapshot
Relating Equivalence and Reducibility to Sparse Sets
inferred← citeshttps://doi.org/10.1145/2421119.2421135openalex-snapshot
SIGACT News Complexity Theory Column 76
inferred← citeshttps://doi.org/10.2307/2273858openalex-snapshot
Classifying the computational complexity of problems
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05825openalex-snapshot
NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications
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.