@InProceedings{mazor_et_al:LIPIcs.CCC.2024.36,
author = {Mazor, Noam and Pass, Rafael},
title = {{Gap MCSP Is Not (Levin) NP-Complete in Obfustopia}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.36},
URN = {urn:nbn:de:0030-drops-204322},
doi = {10.4230/LIPIcs.CCC.2024.36},
annote = {Keywords: Kolmogorov complexity, MCSP, Levin Reduction}
}