On the public citation graph
Gradually intractable problems and nondeterministic log-space lower bounds
0 signed · 21 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/bf00263746openalex-snapshot
Transformational methods and their application to complexity problems
inferredcites →https://doi.org/10.1007/bf01683259openalex-snapshot
New problems complete for nondeterministic log space
inferredcites →https://doi.org/10.1016/s0022-0000(73)80048-0openalex-snapshot
On two-way multihead automata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80050-xopenalex-snapshot
Space-bounded reducibility among combinatorial problems
inferredcites →https://doi.org/10.1016/s0022-0000(77)80041-xopenalex-snapshot
Techniques for separating space complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(77)80042-1openalex-snapshot
Relating refined space complexity classes
inferredcites →https://doi.org/10.1137/0208046openalex-snapshot
Classes of Pebble Games and Complete Problems
inferredcites →https://doi.org/10.1145/62.322433openalex-snapshot
Some combinatorial game problems require Ω( n k ) time
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_83openalex-snapshot
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_19openalex-snapshot
Recent results on the complexity of problems related to Petri nets
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_6openalex-snapshot
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_23openalex-snapshot
Intersection Non-emptiness and Hardness Within Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_26openalex-snapshot
On the Complexity of Existential Pebble Games
inferred← citeshttps://doi.org/10.1007/bf02090765openalex-snapshot
Communicating processes, scheduling, and the complexity of nontermination
inferred← citeshttps://doi.org/10.1007/bfb0028820openalex-snapshot
A multiparameter analysis of the boundedness problem for vector addition systems
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90006-1openalex-snapshot
A multiparameter analysis of the boundedness problem for vector addition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90137-xopenalex-snapshot
Simultaneous (poly-time, log-space) lower bounds
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90031-xopenalex-snapshot
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90004-yopenalex-snapshot
A multiparameter analysis of domino tiling with an application to concurrent systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50028-9openalex-snapshot
SIMPLE PROGRAMS WITH A FIXED NUMBER OF VARIABLES SEEM STILL HARD TO ANALYZE
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.