On Lower Bounds for Read-k-Times Branching Programs (1993)

Cached

Download Links

by Allan Borodin , Alexander A. Razborov , Roman Smolensky
Venue:COMPUTATIONAL COMPLEXITY
Citations:50 - 0 self