![]() |
@article{DBLP:journals/cc/BorodinRS93,
author = {Allan Borodin and
Alexander A. Razborov and
Roman Smolensky},
title = {On Lower Bounds for Read-K-Times Branching Programs},
journal = {Computational Complexity},
volume = {3},
year = {1993},
pages = {1-18},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-01-03 by Michael Ley (ley@uni-trier.de)