Matthias Homeister. Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), (068), 2003. [doi]
@article{ECCC-TR03-068,
title = {Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs},
author = {Matthias Homeister},
year = {2003},
url = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-068/index.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ECCC-TR03-068},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {068},
}