@InProceedings{santhanam:LIPIcs.FSTTCS.2022.2,
author = {Santhanam, Rahul},
title = {{Why MCSP Is a More Important Problem Than SAT}},
booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
year = {2022},
volume = {250},
editor = {Dawar, Anuj and Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.2},
URN = {urn:nbn:de:0030-drops-173943},
doi = {10.4230/LIPIcs.FSTTCS.2022.2},
annote = {Keywords: Minimum Circuit Size Problem, Satisfiability, Cryptography, Learning, Approximation}
}