Allan Borodin Alexander A. Razborov Roman Smolensky On Lower Bounds for Read-K-Times Branching Programs. 1-18 1993 3 Computational Complexity db/journals/cc/cc3.html#BorodinRS93