On the public citation graph

A note on relativized log space

https://doi.org/10.1007/bf01744581
0 signed · 16 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/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1007/bf01744301openalex-snapshot
On relativizing auxiliary pushdown machines
inferredcites →https://doi.org/10.1016/0304-3975(78)90003-8openalex-snapshot
Log space machines with multiple oracle tapes
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1145/800105.803407openalex-snapshot
Computations with a restricted number of nondeterministic steps (Extended Abstract)

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-16761-7_70openalex-snapshot
Decompositions of nondeterministic reductions
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90087-1openalex-snapshot
Separation with the Ruzzo, Simon, and Tompa relativization implies Dspace(log n) ≠ Nspace(log n)
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90025-4openalex-snapshot
Decompositions of nondeterministic reductions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90168-hopenalex-snapshot
Positive relativizations for log space computability
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
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.