Abstract
Many problems of interest in the field of electronic design automation can be formulated as binate covering problems. This occurs whenever the solution sought for is the minimum cost assignment satisfying a boolean formula in conjunctive form. Practical problems may have hundreds of variables and thousands of clauses; hence efficient techniques are important. In this paper we propose a new iterative scheme that is based on solving a sequence of sub-problems that normally lead to the solution of the original problem in a fraction of the time.
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.
