TY - JOUR A1 - Homeister, Matthias T1 - Lower bounds for restricted read-once parity branching programs T2 - Theoretical Computer Science KW - Read-once parity branching programs KW - Lower bounds KW - Computational complexity Y1 - 2017 UR - https://opus4.kobv.de/opus4-fhbrb/frontdoor/index/index/docId/1826 SN - 0304-3975; 1879-2294 VL - 359 IS - 1-3 SP - 1 EP - 14 ER -