A simple function that requires exponential size read-once branching programs

https://doi.org/10.1016/S0020-0190(97)00041-0Get rights and content

Abstract

We present a Boolean function in n variables that is computable in depth 2 monotone AC0 but requires 2Ω(√n) size read-once branching programs. The function we consider is defined by the blocking sets of a finite projective plane.

References (21)

There are more references available in the full text version of this article.

Cited by (19)

  • Lower bounds for linearly transformed OBDDs and FBDDs

    2002, Journal of Computer and System Sciences
  • Time-space tradeoffs for branching programs

    2001, Journal of Computer and System Sciences
View all citing articles on Scopus
View full text