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 T2 - 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 - 2017 UR - https://opus4.kobv.de/opus4-fhbrb/frontdoor/index/index/docId/1835 SN - 1290-385X (Online) SN - 0988-3754 (Print) VL - 36 IS - 3 SP - 229 EP - 247 ER -