OKFDDs versus OBDDs and OFDDs

DOI10.1007/3-540-60084-1_98zbMath1412.68046OpenAlexW1524912049WikidataQ59243126 ScholiaQ59243126MaRDI QIDQ4645202

Bernd Becker, Michael Theobald, Rolf Drechsler

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

zbMATH Keywords

Boolean functiondesign automationpolynomial sizeefficient representationterminal vertex

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Ordered binary decision diagrams and the Shannon effect

Cites Work

• Unnamed Item
• On the relation between BDDs and FDDs
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Fast OFDD-based minimization of fixed polarity Reed-Muller expressions

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