| dc.contributor.author | Huang, Yizhi | |
| dc.contributor.author | Ilango, Rahul | |
| dc.contributor.author | Ren, Hanlin | |
| dc.date.accessioned | 2023-07-10T15:45:13Z | |
| dc.date.available | 2023-07-10T15:45:13Z | |
| dc.date.issued | 2023-06-02 | |
| dc.identifier.isbn | 978-1-4503-9913-5 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/151051 | |
| dc.publisher | ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing | en_US |
| dc.relation.isversionof | https://doi.org/10.1145/3564246.3585154 | en_US |
| dc.rights | 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. | en_US |
| dc.source | Association for Computing Machinery | en_US |
| dc.title | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Huang, Yizhi, Ilango, Rahul and Ren, Hanlin. 2023. "NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach." | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.identifier.mitlicense | PUBLISHER_POLICY | |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2023-07-01T07:53:02Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | The author(s) | |
| dspace.date.submission | 2023-07-01T07:53:02Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
