A non-linear time lower bound for Boolean branching programs (1999)

by M Ajtai
Venue:In Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS’99