On lower bounds for read-k times branching programs, Comput. Complexity 3 (1993)

by A Borodin, A Razborov, R Smolensky