| dc.contributor.author | Chan, Timothy | |
| dc.contributor.author | Vassilevska Williams, Virginia | |
| dc.contributor.author | Xu, Yinzhan | |
| dc.date.accessioned | 2022-11-15T13:11:41Z | |
| dc.date.available | 2022-11-15T13:11:41Z | |
| dc.date.issued | 2022-06-09 | |
| dc.identifier.isbn | 978-1-4503-9264-8 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/146418 | |
| dc.publisher | ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | en_US |
| dc.relation.isversionof | https://doi.org/10.1145/3519935.3520032 | 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 | ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | en_US |
| dc.title | Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Chan, Timothy, Vassilevska Williams, Virginia and Xu, Yinzhan. 2022. "Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV." | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| 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 | 2022-11-03T12:09:50Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | The author(s) | |
| dspace.date.submission | 2022-11-03T12:09:51Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
