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

Miklós Ajtai A Non-linear Time Lower Bound for Boolean Branching Programs. 60-70 1999 FOCS http://computer.org/proceedings/focs/0409/04090060abs.htm db/conf/focs/focs99.html#Ajtai99