OBDD minimization based on two-level representation of Boolean functions

DOI10.1109/12.895868MaRDI QIDQ4571387zbMATH OpenOpenAlexFDO

Authors Yu-Liang Wu, Malgorzata Marek-Sadowska, C. K. Wong, Hongbing Fan

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Boolean functions (06E30) Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the OBDD-representation of general Boolean functions
• Mathematical Foundations of Computer Science 2004
• Approximating Boolean functions by OBDDs
• Boolean function minimization in the class of disjunctive normal forms
• Size of OBDD representation of 2-level redundancies functions
• scientific article; zbMATH DE number 3894979
• scientific article; zbMATH DE number 2053104
• Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
• scientific article; zbMATH DE number 2210682
• scientific article; zbMATH DE number 4089620

This page was built for publication: OBDD minimization based on two-level representation of Boolean functions

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