Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs

Martin Sauerhoff. Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 5(18), 1998. [doi]

Abstract

Abstract is missing.