Compressing Binary Decision Diagrams

Simple item page
dc.creatorHansen, Esben Rune
dc.creatorRao, S. Srinivasa
dc.creatorTiedemann, Peter
dc.date2008-05-21
dc.date.accessioned2026-07-07T12:19:09Z
dc.date.available2026-07-07T12:19:09Z
dc.descriptionThe 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.
dc.descriptionFull (tech-report) version of ECAI 2008 short paper
dc.identifierhttps://arxiv.org/abs/0805.3267
dc.identifierhttp://arxiv.org/abs/0805.3267
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212652
dc.subjectArtificial Intelligence
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleCompressing Binary Decision Diagrams
dc.typetext

Files

Collections

arXiv