Paul E. Dunne. Lower bounds on the complexity of 1-time only branching programs. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 90-99, Springer, 1985.
@inproceedings{Dunne85,
title = {Lower bounds on the complexity of 1-time only branching programs},
author = {Paul E. Dunne},
year = {1985},
tags = {e-science},
researchr = {https://researchr.org/publication/Dunne85},
cites = {0},
citedby = {0},
pages = {90-99},
booktitle = {Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985},
editor = {Lothar Budach},
volume = {199},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-15689-5},
}