Tags:
tag this topic
create new tag
view all tags
---+ 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. -- Main.KrisDeVolder - 09 May 2005
Attachments
Attachments
Topic attachments
I
Attachment
History
Action
Size
Date
Who
Comment
pdf
bdd.pdf
r1
manage
301.2 K
2005-05-09 - 14:59
KrisDeVolder
. R.E. Bryant. IEEE Transactions on Computing 1986. Graph-Based Algorithms for Boolean Function Manipulation.
E
dit
|
A
ttach
|
Watch
|
P
rint version
|
H
istory
: r1
|
B
acklinks
|
V
iew topic
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r1 - 2005-05-09
-
KrisDeVolder
Home
Site map
BETA web
Communications web
Faculty web
Imager web
LCI web
Main web
SPL web
Sandbox web
TWiki web
TestCases web
SPL Web
Create New Topic
Index
Search
Changes
Notifications
RSS Feed
Statistics
Preferences
P
P
View
Raw View
Print version
Find backlinks
History
More topic actions
Edit
Raw edit
Attach file or image
Edit topic preference settings
Set new parent
More topic actions
Account
Log In
Register User
E
dit
A
ttach
Copyright © 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