On the public citation graph

Two characterizations of the logarithmic alternation hierarchy

https://doi.org/10.1007/bfb0016278
0 signed · 25 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/3-540-16078-7_85openalex-snapshot
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
inferredcites →https://doi.org/10.1007/3-540-16761-7_70openalex-snapshot
Decompositions of nondeterministic reductions
inferredcites →https://doi.org/10.1007/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1137/0216052openalex-snapshot
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
inferredcites →https://doi.org/10.1145/322033.322037openalex-snapshot
Log Space Recognition and Translation of Parenthesis Languages
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1996.0084openalex-snapshot
Inductive Counting for Width-Restricted Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_46openalex-snapshot
The logarithmic alternation hierarchy collapses: $$A\Sigma _2^\mathcal{L} = A\Pi _2^\mathcal{L}$$
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_5openalex-snapshot
A Generalized Quantifier Concept in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_74openalex-snapshot
Inductive counting below logspace
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_96openalex-snapshot
Empty alternation
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_120openalex-snapshot
Comparing counting classes for logspace, one-way logspace, and first-order
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/bfb0015925openalex-snapshot
Complexity theory and formal languages
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90012-6openalex-snapshot
The logarithmic alternation hierarchy collapses: AΣ2L = AΠ2L
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.006openalex-snapshot
Complexity classes of equivalence problems revisited
inferred← citeshttps://doi.org/10.1145/203610.203611openalex-snapshot
The satanic notations
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.