![]() |
@article{DBLP:journals/eccc/ECCC-TR03-068,
author = {Matthias Homeister},
title = {Lower Bounds for the Sum of Graph--driven Read--Once Parity
Branching Programs},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {068},
year = {2003},
ee = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-068/index.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2006-06-30 by Michael Ley (ley@uni-trier.de)