TY - JOUR A1 - Brosenne, Henrik A1 - Homeister, Matthias A1 - Waack, Stephan T1 - Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs JF - RAIRO - Theoretical Informatics and Applications (ITA) KW - Well-structured graph-driven parity-FBDDs KW - lower bounds KW - minimization algorithm KW - complexity theory KW - data structures for Boolean functions Y1 - 2002 U6 - https://doi.org/10.1051/ita:2002011 SN - 1290-385X (Online) SN - 0988-3754 (Print) VL - 36 IS - 3 SP - 229 EP - 247 ER - 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 -