A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complexity of two-level logic minimization
2006
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions
doi:10.1109/tcad.2005.855944
fatcat:gugijsvw4zcqrbc7dzhyy7zvgu