On the public citation graph

Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time

https://doi.org/10.1007/bfb0029633
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.1007/3-540-51498-8_12openalex-snapshot
Separating completely complexity classes related to polynomial size Ω-Decision trees
inferredcites →https://doi.org/10.1007/3-540-51498-8_28openalex-snapshot
On oblivious branching programs of linear length
inferredcites →https://doi.org/10.1007/bf02090768openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0016269openalex-snapshot
Lower bounds on the complexity of local circuits
inferredcites →https://doi.org/10.1007/bfb0017163openalex-snapshot
Separating the eraser turing machine classes Le, NLe, co-NLe and Pe
inferredcites →https://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0035834openalex-snapshot
The power of polynomial size Ω-branching programs
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0890-5401(91)90039-5openalex-snapshot
On oblivious branching programs of linear length
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
inferredcites →https://doi.org/10.1109/sct.1989.41831openalex-snapshot
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
inferredcites →https://doi.org/10.1109/sfcs.1986.31openalex-snapshot
Meanders, Ramsey theory and lower bounds for branching programs
inferredcites →https://doi.org/10.1109/swat.1966.30openalex-snapshot
The recognition problem for the set of perfect squares
inferredcites →https://doi.org/10.1145/42282.46161openalex-snapshot
On the complexity of branching programs and decision trees for clique functions

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.2000.3022openalex-snapshot
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_60openalex-snapshot
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_190openalex-snapshot
Separating counting communication complexity classes
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_269openalex-snapshot
Separating complexity classes related to bounded alternating Ω-branching programs
inferred← citeshttps://doi.org/10.1007/bf01294594openalex-snapshot
Separating complexity classes related to bounded alternating ?-branching programs
inferred← citeshttps://doi.org/10.1007/bfb0023460openalex-snapshot
On the descriptive and algorithmic power of parity ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1007/bfb0029591openalex-snapshot
Mathematical Foundations of Computer Science 1990
inferred← citeshttps://doi.org/10.1007/bfb0029596openalex-snapshot
Restricted branching programs and their computational power
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90150-vopenalex-snapshot
Problems complete for ⊕ L
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00005-4openalex-snapshot
Geometric arguments yield better bounds for threshold circuits and distributed computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.035openalex-snapshot
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93174-3openalex-snapshot
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
inferred← citeshttps://doi.org/10.1109/ccc.2001.933884openalex-snapshot
On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs
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.