Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs

Matthias Homeister Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 2003 068 db/journals/eccc/eccc10.html#ECCC-TR03-068 http://eccc.hpi-web.de/eccc-reports/2003/TR03-068/index.html