Compressing Binary Decision Diagrams
- Esben Rune Hansen,
- Srinivasa Rao Satti,
- Peter Tiedemann
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review
Open access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 799-800 Publication milestones
- Published - 2008
Publication status
Published - 2008
Publisher
Association for Computing Machinery, United StatesISBN (Print)
978-1-58603-891-5 Host publication title
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence Abstract
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node.
Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances
Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances