Janos Simon, Mario Szegedy. A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. In Jin-yi Cai, editor, Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990. Volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 183-194, DIMACS/AMS, 1990.
@inproceedings{SimonS90-0,
title = {A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications},
author = {Janos Simon and Mario Szegedy},
year = {1990},
researchr = {https://researchr.org/publication/SimonS90-0},
cites = {0},
citedby = {0},
pages = {183-194},
booktitle = {Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990},
editor = {Jin-yi Cai},
volume = {13},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}