On the public citation graph

Inclusion complete tally languages and the Hartmanis-Berman conjecture

https://doi.org/10.1007/bf01768464
0 signed · 35 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.1007/bf00289080openalex-snapshot
A note on multihead automata and context-sensitive languages
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)90057-8openalex-snapshot
Translational lemmas, polynomial time, and (log n)j-space
inferredcites →https://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot
Tally languages and complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(74)80008-5openalex-snapshot
Comparing complexity classes
inferredcites →https://doi.org/10.1137/0203021openalex-snapshot
Computationally Related Problems
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/800113.803628openalex-snapshot
On isomorphisms and density of NP and other complete sets
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas

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-08860-1_6openalex-snapshot
Relationship between density and deterministic complexity of MP-complete languages
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_44openalex-snapshot
P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_41openalex-snapshot
Some observations about NP complete sets
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_44openalex-snapshot
On the limitations of locally robust positive reductions
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-4613-3394-4openalex-snapshot
Advances in Algorithms, Languages, and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_22openalex-snapshot
The Complexity of Unions of Disjoint Sets
inferred← citeshttps://doi.org/10.1007/bf01744288openalex-snapshot
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
inferred← citeshttps://doi.org/10.1007/bf02090391openalex-snapshot
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
inferred← citeshttps://doi.org/10.1007/bf02679465openalex-snapshot
Expressing Uniformity via Oracles
inferred← citeshttps://doi.org/10.1007/bfb0022494openalex-snapshot
An essay about research on sparse NP complete sets
inferred← citeshttps://doi.org/10.1007/bfb0039600openalex-snapshot
A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90024-8openalex-snapshot
On sparse sets in NP–P
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.1016/0022-0000(83)90027-2openalex-snapshot
A low and a high hierarchy within NP
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90006-iopenalex-snapshot
A complexity theory for feasible closure properties
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90039-1openalex-snapshot
Reductions on NP and P-selective sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80004-8openalex-snapshot
Sparse sets in NP-P: EXPTIME versus NEXPTIME
inferred← citeshttps://doi.org/10.1109/sct.1991.160240openalex-snapshot
A complexity theory for feasible closure properties
inferred← citeshttps://doi.org/10.1109/sct.1994.315811openalex-snapshot
On the structure of complete sets
inferred← citeshttps://doi.org/10.1145/3457588.3457597openalex-snapshot
SIGACT News Complexity Theory Column 108
inferred← citeshttps://doi.org/10.1145/800061.808769openalex-snapshot
Sparse sets in NP-P
inferred← citeshttps://doi.org/10.31274/rtd-180813-10619openalex-snapshot
On the structure of intractable sets
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.