@article{BrosenneHomeisterWaack2002, author = {Brosenne, Henrik and Homeister, Matthias and Waack, Stephan}, title = {Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs}, series = {RAIRO - Theoretical Informatics and Applications (ITA)}, volume = {36}, journal = {RAIRO - Theoretical Informatics and Applications (ITA)}, number = {3}, issn = {1290-385X (Online)}, doi = {10.1051/ita:2002011}, pages = {229 -- 247}, year = {2002}, language = {en} } @article{Homeister2003, author = {Homeister, Matthias}, title = {Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs}, series = {Electronic colloquium on computational complexity : ECCC : research reports, surveys and books in computational complexity}, journal = {Electronic colloquium on computational complexity : ECCC : research reports, surveys and books in computational complexity}, number = {Report No. 68}, issn = {1433-8092}, pages = {15}, year = {2003}, language = {en} }