Martin Sauerhoff. Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). In Michel Morvan, Christoph Meinel, Daniel Krob, editors, STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings. Volume 1373 of Lecture Notes in Computer Science, pages 105-115, Springer, 1998.
@inproceedings{Sauerhoff98,
title = {Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)},
author = {Martin Sauerhoff},
year = {1998},
researchr = {https://researchr.org/publication/Sauerhoff98},
cites = {0},
citedby = {0},
pages = {105-115},
booktitle = {STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings},
editor = {Michel Morvan and Christoph Meinel and Daniel Krob},
volume = {1373},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64230-7},
}