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

Yizhi Huang, Rahul Ilango, Hanlin Ren. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023. [doi]

Abstract

Abstract is missing.