On the public citation graph

Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

https://doi.org/10.1007/bfb0028795
0 signed · 16 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-17660-8_43openalex-snapshot
On the complexity of branching programs and decision trees for clique functions
inferredcites →https://doi.org/10.1007/bfb0030331openalex-snapshot
A lower bound on complexity of branching programs
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/swat.1966.30openalex-snapshot
The recognition problem for the set of perfect squares
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.1007/10719839_20openalex-snapshot
Almost k-Wise Independence and Hard Boolean 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-031-49190-0_3openalex-snapshot
Streaming and Query Once Space Complexity of Longest Increasing Subsequence
inferred← citeshttps://doi.org/10.1007/bfb0016269openalex-snapshot
Lower bounds on the complexity of local circuits
inferred← citeshttps://doi.org/10.1007/bfb0029991openalex-snapshot
A hierarchy for (1, +k)-branching programs with respect to k
inferred← citeshttps://doi.org/10.1007/bfb0036199openalex-snapshot
On the hierarchy of nondeterministic branching k-programs
inferred← citeshttps://doi.org/10.1007/bfb0055059openalex-snapshot
On branching programs with bounded uncertainty
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00219-9openalex-snapshot
A read-once lower bound and a (1,+k)-hierarchy for branching programs
inferred← citeshttps://doi.org/10.1051/ita/1988220404471openalex-snapshot
Lower bounds on the complexity of real-time branching programs
inferred← citeshttps://doi.org/10.1145/42282.46161openalex-snapshot
On the complexity of branching programs and decision trees for clique functions
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.