Showing papers by "Center for Discrete Mathematics and Theoretical Computer Science published in 1997"
••
TL;DR: A Boolean function in n variables that is computable in depth 2 monotone AC0 but requires 2 Ω(√n) size read-once branching programs and is defined by the blocking sets of a finite projective plane is presented.
20 citations