On the NP-Completeness of the Minimum Circuit Size Problem

John M. Hitchcock, Aduri Pavan. On the NP-Completeness of the Minimum Circuit Size Problem. In Prahladh Harsha, G. Ramalingam, editors, 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India. Volume 45 of LIPIcs, pages 236-245, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

Abstract

Abstract is missing.