On the public citation graph

The power of polynomial size Ω-branching programs

https://doi.org/10.1007/bfb0035834
0 signed · 32 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/bfb0016279openalex-snapshot
p-Projection reducibility and the complexity classes ℒ (nonuniform) and Nℒ (nonuniform)
inferredcites →https://doi.org/10.1016/s0019-9958(84)80031-5openalex-snapshot
Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
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/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
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
inferredcites →https://doi.org/10.2307/2370324openalex-snapshot
Introduction to a General Theory of Elementary Propositions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45687-2_10openalex-snapshot
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_82openalex-snapshot
Switching graphs and their complexity
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-56503-5_57openalex-snapshot
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
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/bfb0017163openalex-snapshot
Separating the eraser turing machine classes Le, NLe, co-NLe and Pe
inferred← citeshttps://doi.org/10.1007/bfb0028553openalex-snapshot
Lower bounds for randomized read-k-times branching programs
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/s00224-004-1130-1openalex-snapshot
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90093-dopenalex-snapshot
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90021-sopenalex-snapshot
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90257-gopenalex-snapshot
Separating complexity classes related to Ω-decision trees
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00037-0openalex-snapshot
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
inferred← citeshttps://doi.org/10.1051/ita/1992260403451openalex-snapshot
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
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.1109/ccc.1996.507674openalex-snapshot
Hierarchies of circuit classes that are closed under complement
inferred← citeshttps://doi.org/10.1109/sct.1989.41831openalex-snapshot
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
inferred← citeshttps://doi.org/10.1137/0219026openalex-snapshot
Expressibility and Nonuniform Complexity Classes
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.