On the public citation graph
Adaptive logspace reducibility and parallel time
0 signed · 34 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/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(89)90024-xopenalex-snapshot
PNP[(log )] and sparse turing-complete sets for NP
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
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(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferredcites →https://doi.org/10.1016/s0019-9958(84)80030-3openalex-snapshot
On similarity and duality of computation (I)
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.1988.5271openalex-snapshot
Two applications of complementation via inductive counting
inferredcites →https://doi.org/10.1109/sct.1988.5282openalex-snapshot
On truth-table reducibility to SAT and the difference hierarchy over NP
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0218038openalex-snapshot
Two Applications of Inductive Counting for Complementation Problems
inferredcites →https://doi.org/10.1137/0219024openalex-snapshot
On the Decomposability of $NC$ and $AC$
inferredcites →https://doi.org/10.1145/12130.12138openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1145/28395.28408openalex-snapshot
The strong exponential hierarchy collapses
inferredcites →https://doi.org/10.1145/28395.28409openalex-snapshot
The Boolean formula value problem is in ALOGTIME
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-1-4613-3394-4_2openalex-snapshot
Algorithms for Learning Finite Automata from Queries: A Unified View
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_13openalex-snapshot
Reductions to Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_24openalex-snapshot
Universality of Regular Realizability Problems
inferred← citeshttps://doi.org/10.1007/s00224-008-9144-8openalex-snapshot
Equivalence Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/s00224-008-9159-1openalex-snapshot
Reductions to Graph Isomorphism
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00033-sopenalex-snapshot
On adaptive DLOGTIME and POLYLOGTIME reductions
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00091-0openalex-snapshot
A note on closure properties of logspace MOD classes
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1109/sct.1994.315797openalex-snapshot
Relationships among PL, #L, and the determinant
inferred← citeshttps://doi.org/10.1134/s0032946013030058openalex-snapshot
On expressive power of regular realizability problems
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0606openalex-snapshot
On complexity of regular realizability problems
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.