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
Lecture Notes in Computer Science
We study the consequences of NP having non-uniform polynomial size circuits of various types. We continue the work of Agrawal and Arvind  who study the consequences of Sat being many-one reducible to functions computable by non-uniform circuits consisting of a single weighted threshold gate. (Sat ≤ p m LT1). They claim that P = NP follows as a consequence, but unfortunately their proof was incorrect. We take up this question and use results from computational learning theory to show that ifdoi:10.1007/978-3-642-40313-2_23 fatcat:ocm23fh4lzfyppn3w2qp5q4nyq