On the relation between BDDs and FDDs

DOI10.1006/INCO.1995.1167zbMATH Open0839.68022DBLPjournals/iandc/BeckerDW95OpenAlexW2054115926WikidataQ59243132 ScholiaQ59243132MaRDI QIDQ1908345FDOQ1908345

Ralph Werchner, Bernd Becker, Rolf Drechsler

Publication date: 19 March 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/682f12072ce56e639eb71322816623b2853a5ba1

zbMATH Keywords

symmetric functionsdata structures for Boolean functions

Mathematics Subject Classification ID

Data structures (68P05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (11)

• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• Ordered binary decision diagrams and the Shannon effect
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
• A comparison of free BDDs and transformed BDDs
• On the effect of local changes in the variable ordering of ordered decision diagrams
• Variable shift SDD: a more succinct sentential decision diagram
• OKFDDs versus OBDDs and OFDDs
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• On the relation between BDDs and FDDs 👍 👎
• OKFDDs versus OBDDs and OFDDs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the size of binary decision diagrams representing Boolean functions 👍 👎

This page was built for publication: On the relation between BDDs and FDDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908345)