Download citation

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs

RAIRO-Theor. Inf. Appl., 36 3 (2002) 229-247
DOI: https://doi.org/10.1051/ita:2002011