Compressing Binary Decision Diagrams

Details Compressing Binary Decision Diagrams Compressing Binary Decision Diagrams

2008-05-21

arxiv.org/abs/0805.3267v1

Computer Science

Artificial Intelligence

Full (tech-report) version of ECAI 2008 short paper

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compressing Binary Decision Diagrams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressing Binary Decision Diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressing Binary Decision Diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290223