压缩二元决策图
Compressing Binary Decision Diagrams
摘要:
本文介绍了一种新的技术压缩二叉决策图的情况下,随机访问是不需要的。使用这种技术,可以在线性时间内以BDD的大小进行压缩和解压缩,并且压缩在许多情况下将BDD的大小减小到每节点1-2位。我们的压缩技术的实证结果,包括与以前介绍的技术的比较,表明新技术占主导地位的所有测试实例。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。