Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDsHenrik Brosenne, Matthias Homeister and Stephan WaackRAIRO-Theor. Inf. Appl., 36 3 (2002) 229-247DOI: https://doi.org/10.1051/ita:2002011
