On the public citation graph

Complete problems and strong polynomial reducibilities

https://doi.org/10.1007/bfb0028988
0 signed · 39 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0022-0000(88)90007-4openalex-snapshot
Collapsing degrees
inferredcites →https://doi.org/10.1016/0022-0000(88)90033-5openalex-snapshot
Isomorphisms and 1-L reductions
inferredcites →https://doi.org/10.1016/0304-3975(85)90218-xopenalex-snapshot
On one-one polynomial time equivalence relations
inferredcites →https://doi.org/10.1016/0304-3975(86)90152-0openalex-snapshot
On one-way functions and polynomial-time isomorphisms
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1109/sfcs.1978.31openalex-snapshot
One-way log-tape reductions
inferredcites →https://doi.org/10.1109/sfcs.1986.13openalex-snapshot
Collapsing degrees
inferredcites →https://doi.org/10.1137/0206023openalex-snapshot
On Isomorphisms and Density of $NP$ and Other Complete Sets
inferredcites →https://doi.org/10.1145/12130.12160openalex-snapshot
A note on one-way functions and polynomial-time isomorphisms
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.1997.1483openalex-snapshot
DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization
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-55808-x_13openalex-snapshot
The degree structure of 1-L reductions
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/978-1-4612-4478-3_4openalex-snapshot
Juris Hartmanis: Fundamental Contributions to Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_7openalex-snapshot
The Structure of Complete Degrees
inferred← citeshttps://doi.org/10.1007/bf01184812openalex-snapshot
NP-Creative Sets: A New Class of Creative Sets in NP
inferred← citeshttps://doi.org/10.1007/bf01195202openalex-snapshot
An application of the translational method
inferred← citeshttps://doi.org/10.1007/bf01202282openalex-snapshot
On lower bounds of the closeness between complexity classes
inferred← citeshttps://doi.org/10.1007/bf02090397openalex-snapshot
Completeness for nondeterministic complexity classes
inferred← citeshttps://doi.org/10.1007/bfb0093922openalex-snapshot
The isomorphism conjecture and its generalizations
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90045-4openalex-snapshot
On p-creative sets and p-completely creative sets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90323-topenalex-snapshot
One-way functions and the nonisomorphism of NP-complete sets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90388-iopenalex-snapshot
On sets polynomially enumerable by iteration
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90126-eopenalex-snapshot
On 1-truth-table-hard languages
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004349openalex-snapshot
Pseudo-random generators and structure of complete degrees
inferred← citeshttps://doi.org/10.1109/sct.1989.41811openalex-snapshot
p-creative sets vs. p-completely creative sets
inferred← citeshttps://doi.org/10.1109/sct.1990.113949openalex-snapshot
Structural properties of nondeterministic complete sets
inferred← citeshttps://doi.org/10.1109/sct.1990.113974openalex-snapshot
P-productivity and polynomial time approximations
inferred← citeshttps://doi.org/10.1109/sct.1991.160265openalex-snapshot
Exponential time and subexponential time sets
inferred← citeshttps://doi.org/10.1109/sct.1992.215380openalex-snapshot
Some properties of exponential time complexity classes
inferred← citeshttps://doi.org/10.1109/sct.1993.336528openalex-snapshot
With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets
inferred← citeshttps://doi.org/10.1109/sct.1993.336539openalex-snapshot
Polynomial isomorphism of 1-L-complete sets
inferred← citeshttps://doi.org/10.1109/sct.1994.315790openalex-snapshot
On the isomorphism problem for weak reducibilities
inferred← citeshttps://doi.org/10.1109/sct.1994.315811openalex-snapshot
On the structure of complete sets
inferred← citeshttps://doi.org/10.1109/sct.1995.514731openalex-snapshot
The isomorphism conjecture holds and one-way functions exist relative to an oracle
inferred← citeshttps://doi.org/10.1109/sct.1995.514869openalex-snapshot
DSPACE(n)=?NSPACE(n): a degree theoretic characterization
inferred← citeshttps://doi.org/10.1137/s0097539792237188openalex-snapshot
With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
inferred← citeshttps://doi.org/10.2178/jsl/1096901763openalex-snapshot
Every polynomial-time 1-degree collapses if and only if P = PSPACE
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.