On the public citation graph

On Some Deterministic Space Complexity Problems

https://doi.org/10.1137/0211050
0 signed · 18 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/bfb0062837openalex-snapshot
The Computational Complexity of Logical Theories
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0209048openalex-snapshot
Space Lower Bounds for Maze Threadability on Restricted Machines
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19970430102openalex-snapshot
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second ‐ Order Logic
inferred← citeshttps://doi.org/10.1006/jcss.1998.1589openalex-snapshot
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_20openalex-snapshot
The complexity of graph problems for succinctly represented graphs
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_75openalex-snapshot
The complexity of searching succinctly represented graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_30openalex-snapshot
The Complexity of Algorithmic Problems on Succinct Instances
inferred← citeshttps://doi.org/10.1007/978-3-030-29033-7_25openalex-snapshot
Logic Studies in Mainland China
inferred← citeshttps://doi.org/10.1007/s00453-014-9944-yopenalex-snapshot
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
inferred← citeshttps://doi.org/10.1016/0004-3702(96)00014-8openalex-snapshot
The complexity of searching implicit graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90050-8openalex-snapshot
On the complexity of topological sorting
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80004-7openalex-snapshot
Succinct representations of graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1982.3openalex-snapshot
A complexity theory for unbounded fan-in parallelism
inferred← citeshttps://doi.org/10.1137/0213028openalex-snapshot
Constant Depth Reducibility
inferred← citeshttps://doi.org/10.1137/0218043openalex-snapshot
Expressibility and Parallel Complexity
inferred← citeshttps://doi.org/10.4312/as.2022.10.2.243-266openalex-snapshot
Chinese Research on Mathematical Logic and the Foundations of Mathematics
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.