On the public citation graph
A lower bound on complexity of branching programs
0 signed · 48 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/3-540-13331-3_57openalex-snapshot
Bounds for Hodes - Specker theorem
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_23openalex-snapshot
Lengths of Formulas and Elimination of Quantifiers I
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0378-4754(79)90115-0openalex-snapshot
The complexity of computing
inferredcites →https://doi.org/10.1016/s0049-237x(08)70524-xopenalex-snapshot
Lengths of Formulas and Elimination of Quantifiers I
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1137/0211033openalex-snapshot
$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
inferredcites →https://doi.org/10.1145/800061.808736openalex-snapshot
Bounds for width two branching programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1029openalex-snapshot
Superlinear Lower Bounds for Bounded-Width Branching Programs
inferred← citeshttps://doi.org/10.1006/jcss.1997.1530openalex-snapshot
Efficient Oblivious Branching Programs for Threshold and Mod Functions
inferred← citeshttps://doi.org/10.1007/11571155_11openalex-snapshot
On Some Bounds on the Size of Branching Programs (A Survey)
inferred← citeshttps://doi.org/10.1007/11821069_13openalex-snapshot
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_43openalex-snapshot
On the complexity of branching programs and decision trees for clique functions
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_55openalex-snapshot
Exponential lower bounds for real-time branching programs
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_49openalex-snapshot
Lower bounds for deterministic and nondeterministic branching programs
inferred← citeshttps://doi.org/10.1007/978-3-030-30244-3_41openalex-snapshot
On Unordered BDDs and Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_17openalex-snapshot
Boolean Complexity and Ramsey Theorems
inferred← citeshttps://doi.org/10.1007/bf01200059openalex-snapshot
Towards optimal simulations of formulas by bounded-width programs
inferred← citeshttps://doi.org/10.1007/bf01240265openalex-snapshot
Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
inferred← citeshttps://doi.org/10.1007/bfb0017159openalex-snapshot
Branching programs as a tool for proving lower bounds on vlsi computations and optimal algorithms for systolic arrays
inferred← citeshttps://doi.org/10.1007/bfb0028795openalex-snapshot
Lower bounds on the complexity of 1-time only branching programs (Preliminary version)
inferred← citeshttps://doi.org/10.1007/bfb0029596openalex-snapshot
Restricted branching programs and their computational power
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90004-8openalex-snapshot
Time-space trade-offs for branching programs
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90010-9openalex-snapshot
A lower bound for read-once-only branching programs
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90002-5openalex-snapshot
Meanders and their applications in lower bounds arguments
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90011-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90166-1openalex-snapshot
Entropy of contact circuits and lower bounds on their complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90078-9openalex-snapshot
Tradeoffs for language recognition on alternating machines
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90080-2openalex-snapshot
Lower bounds to the complexity of symmetric Boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00181-hopenalex-snapshot
On the size of binary decision diagrams representing Boolean functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.01.012openalex-snapshot
An impossibility gap between width-4 and width-5 permutation branching programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80018-3openalex-snapshot
An exponential lower bound for real-time branching programs
inferred← citeshttps://doi.org/10.1017/s002248120002795xopenalex-snapshot
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines
inferred← citeshttps://doi.org/10.1109/sct.1991.160274openalex-snapshot
Superlinear lower bounds for bounded-width branching programs
inferred← citeshttps://doi.org/10.1109/sfcs.1986.31openalex-snapshot
Meanders, Ramsey theory and lower bounds for branching programs
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365684openalex-snapshot
Efficient oblivious branching programs for threshold functions
inferred← citeshttps://doi.org/10.1137/0215040openalex-snapshot
Bounds for Width Two Branching Programs
inferred← citeshttps://doi.org/10.1137/s0097539790181336openalex-snapshot
Subquadratic Simulations of Balanced Formulae by Branching Programs
inferred← citeshttps://doi.org/10.1145/100216.100251openalex-snapshot
Towards optimal simulations of formulas by bounded-width programs
inferred← citeshttps://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferred← citeshttps://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferred← citeshttps://doi.org/10.1145/42282.46161openalex-snapshot
On the complexity of branching programs and decision trees for clique functions
inferred← citeshttps://doi.org/10.14288/1.0051610openalex-snapshot
Growth processes on formulas and reversible circuits
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.