A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Algorithms for Circuits and Circuits for Algorithms
2014
2014 IEEE 29th Conference on Computational Complexity (CCC)
The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits refers to the design of interesting algorithms which can perform non-trivial circuit analysis of some kind, on either a circuit or a Boolean function given as a truth table. For instance, an algorithm determining whether a given circuit has an input that forces a true output would solve the NP-complete Circuit-SAT problem. Such an
doi:10.1109/ccc.2014.33
dblp:conf/coco/Williams14
fatcat:t2irb2av2bcb5hzfi2dxkrsvqu