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`

.

##
###
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits

2013
*
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
*

We give a nontrivial algorithm for the satisfiability problem for threshold circuits of depth two with a linear number of wires which improves over exhaustive search by an exponential factor. The independently interesting problem of the feasibility of sparse 0-1 integer linear programs is a special case. To our knowledge, our algorithm is the first to achieve constant savings even for the special case of Integer Linear Programming. The key idea is to reduce the satisfiability problem to the

doi:10.1109/focs.2013.58
dblp:conf/focs/ImpagliazzoPS13
fatcat:6x3as7ngizcydac4mpgx7hybve