Martin Sauerhoff. Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 5(18), 1998. [doi]
@article{ECCC-TR98-018,
title = {Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs},
author = {Martin Sauerhoff},
year = {1998},
url = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-018/index.html},
researchr = {https://researchr.org/publication/ECCC-TR98-018},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {5},
number = {18},
}