NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Name
3564246.3585154.pdf
Size
755.54 KB
Format
Adobe PDF
Checksum (MD5)
b07c4ad87c5901967a6a2bece3b4b29e
Author(s)
Huang, Yizhi
Ilango, Rahul
Ren, Hanlin
Date Issued
June 2, 2023
Publisher
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Citation
Huang, Yizhi, Ilango, Rahul and Ren, Hanlin. 2023. "NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3564246.3585154
