%0 Journal Article %A Brosenne, Henrik %A Homeister, Matthias %A Waack, Stephan %T Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2002 %P 229-247 %V 36 %N 3 %I EDP-Sciences %U https://doi.org/10.1051/ita:2002011 %R 10.1051/ita:2002011 %G en %F ITA_2002__36_3_229_0