%0 Journal Article
%A Bollig, Beate
%T Complexity theoretical results on nondeterministic graph-driven read-once branching programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2003
%P 51-66
%V 37
%N 1
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita:2003010/
%R 10.1051/ita:2003010
%G en
%F ITA_2003__37_1_51_0