Go to the corresponding LIPIcs Volume Portal 
Hitchcock, John M. ; Pavan, A.
pdfformat: 

@InProceedings{hitchcock_et_al:LIPIcs:2015:5661, author = {John M. Hitchcock and A. Pavan}, title = {{On the NPCompleteness of the Minimum Circuit Size Problem}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {236245}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897972}, ISSN = {18688969}, year = {2015}, volume = {45}, editor = {Prahladh Harsha and G. Ramalingam}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5661}, URN = {urn:nbn:de:0030drops56613}, doi = {10.4230/LIPIcs.FSTTCS.2015.236}, annote = {Keywords: Minimum Circuit Size, NPcompleteness, truthtable reductions, circuit complexity} }
Keywords:  Minimum Circuit Size, NPcompleteness, truthtable reductions, circuit complexity  
Seminar:  35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)  
Issue Date:  2015  
Date of publication:  11.12.2015 