TY - JOUR A1 - Homeister, Matthias T1 - Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs JF - Electronic colloquium on computational complexity : ECCC : research reports, surveys and books in computational complexity KW - Computational Complexity KW - lower bounds KW - read--once parity branching programs Y1 - 2003 UR - https://eccc.weizmann.ac.il/report/2003/068/ SN - 1433-8092 N1 - Paper: TR03-068 IS - Report No. 68 ER -