The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function

Beate Bollig. The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function. Electronic Colloquium on Computational Complexity (ECCC), 14(110), 2007. [doi]

Abstract

Abstract is missing.