Abstract
Ordered binary and functional decision diagrams (OBDDs and OFDDs) have turned out to be useful representations of Boolean functions with many applications. Since it is NP-hard to compute an optimal variable ordering or to improve a given variable ordering, local search and simulated annealing algorithms are used to improve variable orderings. The effect of local changes in variable orderings is studied and a simulated annealing algorithm for the computation of good variable orderings is presented. For several benchmark circuits the best known variable orderings are improved significantly.
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.
