A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and its Applications
Beate Bollig and Philipp Woelfel
BibTeX:
@inproceedings{InProc-BW2002b,
author = {Beate Bollig and Philipp Woelfel},
title = {A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and its Applications},
booktitle = {Mathematical Foundations of Computer Science, 27th International Symposium (MFCS)},
pages = {131-142},
year = {2002},
series = {LNCS},
volume = {2420},
doi = {10.1007/3-540-45687-2_10},
}