May 16, 2023Open Access

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

It is a long-standing open problem whether the Minimum Circuit Size Problem (MCSP) and related meta-complexity problems are NP-complete. Even for the rare cases where the NP-hardness of meta-complexity problems are known, we only know very weak hardness of approximation.

Me gusta

Guardar

Ver artículo completo

Cite This Study

Huang et al. (Tue,) studied this question.

synapsesocial.com/papers/6a1faa2c7f8f0ece98f87b44 https://doi.org/https://doi.org/10.1145/3564246.3585154

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Robustness of average-case meta-complexity via pseudorandomness2022 · 15 citations
2NP-Hardness of Learning Programs and Partial MCSP2022 · 23 citations
3The Non-hardness of Approximating Circuit Size2019 · 5 citations
4Non-Black-Box Worst-Case to Average-Case Reductions within NP2018 · 47 citations
5Three approaches to the quantitative definition of information<sup>*</sup>1968 · 2,047 citations

Me gusta

Guardar

Ver artículo completo