A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
SAT-based Circuit Local Improvement
[article]
2022
arXiv
pre-print
Finding exact circuit size is a notorious optimization problem in practice. Whereas modern computers and algorithmic techniques allow to find a circuit of size seven in blink of an eye, it may take more than a week to search for a circuit of size thirteen. One of the reasons of this behavior is that the search space is enormous: the number of circuits of size s is s^Θ(s), the number of Boolean functions on n variables is 2^2^n. In this paper, we explore the following natural heuristic idea for
arXiv:2102.12579v3
fatcat:kvmebueahrbsblcw67pwtxcdvm