The optimal read-once branching program complexity for the direct storage access function

Authors:
Beate Bollig
Affiliations:
FB Informatik, LS2, Univ. Dortmund, 44221 Dortmund, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 3
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
Branching programs and binary decision diagrams: theory and applications

Branching programs and binary decision diagrams: theory and applications
A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Branching programs are computation models measuring the space of (Turing machine) computations. Read-once branching programs (BP1s) are the most general model where each graph-theoretical path is the computation path for some input. Exponential lower bounds on the size of read-once branching programs are known since a long time. Nevertheless, there are only few functions where the BP1 size is asymptotically known exactly. In this paper, the exact BP1 size of a fundamental function, the direct storage access function, is determined.