@InProceedings{saks_et_al:LIPIcs.CCC.2020.26,
author = {Saks, Michael and Santhanam, Rahul},
title = {{Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {26:1--26:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.26},
URN = {urn:nbn:de:0030-drops-125786},
doi = {10.4230/LIPIcs.CCC.2020.26},
annote = {Keywords: Minimum Circuit Size Problem, Turing reductions, circuit lower bounds}
}