| dc.contributor.author | Dalirrooyfard, Mina | |
| dc.contributor.author | Li, Ray | |
| dc.contributor.author | Williams, Virginia Vassilevska | |
| dc.date.accessioned | 2022-07-21T17:04:37Z | |
| dc.date.available | 2022-07-21T17:04:37Z | |
| dc.date.issued | 2022-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/143944 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | en_US |
| dc.relation.isversionof | 10.1109/focs52979.2021.00102 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Hardness of Approximate Diameter: Now for Undirected Graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Dalirrooyfard, Mina, Li, Ray and Williams, Virginia Vassilevska. 2022. "Hardness of Approximate Diameter: Now for Undirected Graphs." 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). | |
| 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.relation.journal | 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | en_US |
| dc.eprint.version | Original manuscript | 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-07-21T17:00:45Z | |
| dspace.orderedauthors | Dalirrooyfard, M; Li, R; Williams, VV | en_US |
| dspace.date.submission | 2022-07-21T17:00:46Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
