On the public citation graph

Separating the eraser turing machine classes Le, NLe, co-NLe and Pe

0 signed · 28 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-18740-5_55openalex-snapshot
Exponential lower bounds for real-time branching programs
inferredcites →https://doi.org/10.1007/bf01157687openalex-snapshot
Lower bounds on monotone complexity of the logical permanent
inferredcites →https://doi.org/10.1007/bfb0035834openalex-snapshot
The power of polynomial size Ω-branching programs
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
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.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferredcites →https://doi.org/10.1145/800141.804677openalex-snapshot
A time-space tradeoff for sorting on a general sequential model of computation
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11571155_16openalex-snapshot
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_12openalex-snapshot
Separating completely complexity classes related to polynomial size Ω-Decision trees
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_43openalex-snapshot
Ω-branching programs of bounded width
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_35openalex-snapshot
Problems complete for ⊕L
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_56openalex-snapshot
Analysis and manipulation of Boolean functions in terms of decision graphs
inferred← citeshttps://doi.org/10.1007/bf01294594openalex-snapshot
Separating complexity classes related to bounded alternating ?-branching programs
inferred← citeshttps://doi.org/10.1007/bf02679459openalex-snapshot
A reducibility concept for problems defined in terms of ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1007/bfb0023461openalex-snapshot
A reducibility concept for problems defined in terms of ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1007/bfb0029596openalex-snapshot
Restricted branching programs and their computational power
inferred← citeshttps://doi.org/10.1007/bfb0029633openalex-snapshot
Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time
inferred← citeshttps://doi.org/10.1007/bfb0055815openalex-snapshot
On the composition problem for OBDDs with multiple variable orders
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90150-vopenalex-snapshot
Problems complete for ⊕ L
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90046-kopenalex-snapshot
Polynomial size Ω-branching programs and their computational power
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90039-5openalex-snapshot
On oblivious branching programs of linear length
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00216-4openalex-snapshot
On BPP versus NP∪coNP for ordered read-once branching programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00568-6openalex-snapshot
Approximation of boolean functions by combinatorial rectangles
inferred← citeshttps://doi.org/10.1051/ita/1992260605071openalex-snapshot
Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
inferred← citeshttps://doi.org/10.2307/2275203openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic
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.