%0 Journal Article %1 journals/eccc/ECCC-TR03-068 %A Homeister, Matthias %D 2003 %J Electronic Colloquium on Computational Complexity (ECCC) %K dblp %N 068 %T Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs %U http://dblp.uni-trier.de/db/journals/eccc/eccc10.html#ECCC-TR03-068

@article{journals/eccc/ECCC-TR03-068, added-at = {2018-08-14T00:00:00.000+0200}, author = {Homeister, Matthias}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/283fcaee128593729ebd01a757948087a/dblp}, ee = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-068/index.html}, interhash = {a77cde158f8240c801fbbd2b199e0647}, intrahash = {83fcaee128593729ebd01a757948087a}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, keywords = {dblp}, number = 068, timestamp = {2019-09-27T08:32:45.000+0200}, title = {Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs}, url = {http://dblp.uni-trier.de/db/journals/eccc/eccc10.html#ECCC-TR03-068}, year = 2003 }