@inproceedings{6b85475018624318a14db12cd978a46b,
title = "Gap MCSP Is Not (Levin) NP-Complete in Obfustopia",
abstract = "We demonstrate that under believable cryptographic hardness assumptions, Gap versions of standard meta-complexity problems, such as the Minimum Circuit Size Problem (MCSP) and the Minimum Time-Bounded Kolmogorov Complexity problem (MKTP) are not NP-complete w.r.t. Levin (i.e., witness-preserving many-to-one) reductions. In more detail: Assuming the existence of indistinguishability obfuscation, and subexponentially-secure one-way functions, an appropriate Gap version of MCSP is not NP-complete under randomized Levin-reductions. Assuming the existence of subexponentially-secure indistinguishability obfuscation, subexponentially-secure one-way functions and injective PRGs, an appropriate Gap version of MKTP is not NP-complete under randomized Levin-reductions.",
keywords = "Kolmogorov complexity, Levin Reduction, MCSP",
author = "Noam Mazor and Rafael Pass",
note = "Publisher Copyright: {\textcopyright} Noam Mazor and Rafael Pass.; 39th Computational Complexity Conference, CCC 2024 ; Conference date: 22-07-2024 Through 25-07-2024",
year = "2024",
month = jul,
doi = "https://doi.org/10.4230/LIPIcs.CCC.2024.36",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Rahul Santhanam",
booktitle = "39th Computational Complexity Conference, CCC 2024",
address = "ألمانيا",
}