Abstract
Ordered binary decision diagrams (OBDDs) play an important role as data structure for Boolean functions. They are used, e.g., in the logical synthesis process, for verification and test pattern generation, and as part of CAD tools. For a given ordering of the variables and a given Boolean function f the reduced OBDD, i.e. the OBDD of minimal size, is unique (up to isomorphisms) and can be computed from any OBDD G for f of size | G| in time O(¦ G¦log¦ G¦). A new reduction algorithm which works in optimal linear time O(| G|) is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
