Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
RAIRO-Theor. Inf. Appl., 36 3 (2002) 229-247
Published online: 15 December 2002
DOI: 10.1051/ita:2002011