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

Bibliographic Details
Main Authors: Huang, Yizhi, Ilango, Rahul, Ren, Hanlin
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing 2023
Online Access:https://hdl.handle.net/1721.1/151051
Description
Description not available.