Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching ProgramsBeate BolligRAIRO-Theor. Inf. Appl., 37 1 (2003) 51-66DOI: https://doi.org/10.1051/ita:2003010
