On the public citation graph

A note on logspace optimization

https://doi.org/10.1007/bf01268143
0 signed · 29 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.1006/inco.1995.1007openalex-snapshot
The Complexity of Iterated Multiplication
inferredcites →https://doi.org/10.1007/3-540-54458-5_60openalex-snapshot
The complexity of computing maximal word functions
inferredcites →https://doi.org/10.1007/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1007/bf01191473openalex-snapshot
Adaptive logspace reducibility and parallel time
inferredcites →https://doi.org/10.1007/bf01275489openalex-snapshot
The complexity of computing maximal word functions
inferredcites →https://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferredcites →https://doi.org/10.1016/0196-6774(87)90018-6openalex-snapshot
Problems complete for deterministic logarithmic space
inferredcites →https://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
inferredcites →https://doi.org/10.1109/sct.1992.215384openalex-snapshot
Circuits, matrices, and nonassociative computation
inferredcites →https://doi.org/10.1137/0212037openalex-snapshot
Positive Relativizations of Complexity Classes
inferredcites →https://doi.org/10.1137/0213028openalex-snapshot
Constant Depth Reducibility
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1137/0221006openalex-snapshot
Computing Algebraic Formulas Using a Constant Number of Registers
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.4232/1.6372openalex-snapshot
Erleben von Gewalt 1991/92

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_7openalex-snapshot
The Complexity of Obtaining Solutions for Problems in NP and NL
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_28openalex-snapshot
Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/bf01275489openalex-snapshot
The complexity of computing maximal word functions
inferred← citeshttps://doi.org/10.1007/bfb0052085openalex-snapshot
Closure under complementation of logspace complexity classes - A survey -
inferred← citeshttps://doi.org/10.1016/j.ic.2015.04.006openalex-snapshot
Computation by interaction for space-bounded functional programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.005openalex-snapshot
NL-printable sets and nondeterministic Kolmogorov complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00227-2openalex-snapshot
Non-commutative arithmetic circuits: depth reduction and size lower bounds
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80838-7openalex-snapshot
NL-printable sets and Nondeterministic Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1142/s0129054111009057openalex-snapshot
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR
inferred← citeshttps://doi.org/10.1145/167088.167226openalex-snapshot
Depth reduction for noncommutative arithmetic circuits
inferred← citeshttps://doi.org/10.1145/270563.270564openalex-snapshot
Making computation count
inferred← citeshttps://doi.org/10.18419/opus-2706openalex-snapshot
Formal language theory of hairpin formations
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.