OKFDDs versus OBDDs and OFDDs

DOI10.1007/3-540-60084-1_98zbMATH Open1412.68046OpenAlexW1524912049WikidataQ59243126 ScholiaQ59243126MaRDI QIDQ4645202FDOQ4645202

Authors: Bernd Becker, Rolf Drechsler, Michael Theobald 

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_98

Recommendations

• scientific article; zbMATH DE number 910729
• On the relation between BDDs and FDDs
• On the relation between BDDs and FDDs (extended abstract)
• scientific article; zbMATH DE number 1522923
• scientific article; zbMATH DE number 910733

zbMATH Keywords

Boolean functiondesign automationefficient representationpolynomial sizeterminal vertex

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Title not available (Why is that?)
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• On the relation between BDDs and FDDs
• Fast OFDD-based minimization of fixed polarity Reed-Muller expressions

Cited In (3)

• On the relation between BDDs and FDDs
• Ordered binary decision diagrams and the Shannon effect
• On the relation between BDDs and FDDs (extended abstract)

This page was built for publication: OKFDDs versus OBDDs and OFDDs

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