TY  - JOUR
AU  - Bollig, Beate
TI  - Complexity theoretical results on nondeterministic graph-driven read-once branching programs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2003
SP  - 51
EP  - 66
VL  - 37
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2003010/
DO  - 10.1051/ita:2003010
LA  - en
ID  - ITA_2003__37_1_51_0
ER  -