1   Artículos

Characterizing the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs

Revista: RAIRO. SERIE 1: INFORMATIQUE THEORIQUE ET APLIQUEE/THEORETICAL INFORMATICS AND APPLICATIONS    Formato: Impreso

Tabla de contenido: Vol: 36 Num: 3 Par: 0 Año: 2002