Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
Author: | Henrik Brosenne, Matthias HomeisterGND, Stephan Waack |
---|---|
DOI: | https://doi.org/10.1051/ita:2002011 |
ISSN: | 1290-385X (Online) |
ISSN: | 0988-3754 (Print) |
Parent Title (English): | RAIRO - Theoretical Informatics and Applications (ITA) |
Document Type: | Article |
Language: | English |
Year of Publishing: | 2002 |
Date of Publication (online): | 2017/03/02 |
Release Date: | 2017/03/02 |
Tag: | Well-structured graph-driven parity-FBDDs; complexity theory; data structures for Boolean functions; lower bounds; minimization algorithm |
Volume: | 36 |
Issue: | 3 |
First Page: | 229 |
Last Page: | 247 |
Dewey Decimal Classification: | Informatik, Informationswissenschaft, allgemeine Werke / Informatik, Wissen, Systeme / Datenverarbeitung; Informatik |
Naturwissenschaften und Mathematik / Mathematik / Mathematik | |
University Bibliography: | Hochschulbibliografie |
Licence (German): | Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung |