TY - JOUR AU - Brosenne, Henrik AU - Homeister, Matthias AU - Waack, Stephan TI - Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2002 DA - 2002/// SP - 229 EP - 247 VL - 36 IS - 3 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ita:2002011/ UR - https://zbmath.org/?q=an%3A1032.68081 UR - https://www.ams.org/mathscinet-getitem?mr=1958241 UR - https://doi.org/10.1051/ita:2002011 DO - 10.1051/ita:2002011 LA - en ID - ITA_2002__36_3_229_0 ER -