A Non-linear Time Lower Bound for Boolean Branching Programs.

Miklós Ajtai A Non-linear Time Lower Bound for Boolean Branching Programs. 149-176 2005 1 Theory of Computing 1 http://dx.doi.org/10.4086/toc.2005.v001a008 db/journals/toc/toc1.html#Ajtai05