Los puntos clave no están disponibles para este artículo en este momento.
We show broad equivalences in the average-case complexity of many different meta-complexity problems, including Kolmogorov complexity, time-bounded Kolmogorov complexity, and the Minimum Circuit Size Problem. These results hold for a wide range of parameters (various thresholds, approximation gaps, weak or strong average-case hardness, etc.) and complexity notions, showing the theory of meta-complexity is very *robust* in the average-case setting.
Ilango et al. (Thu,) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: