Difference: BDD ( vs. 1)

Revision 12005-05-09 - KrisDeVolder

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="BDDBDDB"

Binary Decision Diagram

An efficient data structure for representing boolean functions.

The most commongly used BDD today are actually Reduced Order BDD.

This is a version of BDD that maximal share subgraphs.

Paper about ROBDD attached.

-- KrisDeVolder - 09 May 2005

META FILEATTACHMENT attr="" comment=". R.E. Bryant. IEEE Transactions on Computing 1986. Graph-Based Algorithms for Boolean Function Manipulation." date="1115650766" name="bdd.pdf" path="bdd.pdf" size="308475" user="kdvolder" version="1.1"
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2025 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback