Martin Sauerhoff. A Lower Bound for Randomized Read-k-Times Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 4(19), 1997. [doi]
@article{ECCC-TR97-019,
title = {A Lower Bound for Randomized Read-k-Times Branching Programs},
author = {Martin Sauerhoff},
year = {1997},
url = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-019/index.html},
researchr = {https://researchr.org/publication/ECCC-TR97-019},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {4},
number = {19},
}