1 results
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 3 / July 2002
- Published online by Cambridge University Press:
- 15 December 2002, pp. 229-247
- Print publication:
- July 2002
-
- Article
- Export citation