NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| 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 |
| _version_ | 1811097389600079872 |
|---|---|
| author | Huang, Yizhi Ilango, Rahul Ren, Hanlin |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Huang, Yizhi Ilango, Rahul Ren, Hanlin |
| author_sort | Huang, Yizhi |
| collection | MIT |
| first_indexed | 2024-09-23T16:58:45Z |
| format | Article |
| id | mit-1721.1/151051 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:58:45Z |
| publishDate | 2023 |
| publisher | ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing |
| record_format | dspace |
| spelling | mit-1721.1/1510512024-01-10T18:30:37Z NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach Huang, Yizhi Ilango, Rahul Ren, Hanlin Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2023-07-10T15:45:13Z 2023-07-10T15:45:13Z 2023-06-02 2023-07-01T07:53:02Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-9913-5 https://hdl.handle.net/1721.1/151051 Huang, Yizhi, Ilango, Rahul and Ren, Hanlin. 2023. "NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach." PUBLISHER_POLICY en https://doi.org/10.1145/3564246.3585154 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. The author(s) application/pdf ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing Association for Computing Machinery |
| spellingShingle | Huang, Yizhi Ilango, Rahul Ren, Hanlin NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title_full | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title_fullStr | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title_full_unstemmed | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title_short | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach |
| title_sort | np hardness of approximating meta complexity a cryptographic approach |
| url | https://hdl.handle.net/1721.1/151051 |
| work_keys_str_mv | AT huangyizhi nphardnessofapproximatingmetacomplexityacryptographicapproach AT ilangorahul nphardnessofapproximatingmetacomplexityacryptographicapproach AT renhanlin nphardnessofapproximatingmetacomplexityacryptographicapproach |