Show simple item record

Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More

dc.contributor.authorChan, Timothy M.
dc.contributor.authorVassilevska Williams, Virginia
dc.contributor.authorXu, Yinzhan
dc.date.accessioned2023-07-06T20:32:06Z
dc.date.available2023-07-06T20:32:06Z
dc.date.issued2023-06-02
dc.identifier.isbn978-1-4503-9913-5
dc.identifier.urihttps://hdl.handle.net/1721.1/151011
dc.publisherACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3564246.3585237en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceAssociation for Computing Machineryen_US
dc.titleFredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and Moreen_US
dc.typeArticleen_US
dc.identifier.citationChan, Timothy M., Vassilevska Williams, Virginia and Xu, Yinzhan. 2023. "Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2023-07-01T07:51:43Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2023-07-01T07:51:43Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

No Thumbnail [100%x160]
Name:
license_rdf
Size:
40bytes
Format:
application/rdf+xml
View/Open
Thumbnail
Name:
3564246.3585237.pdf
Size:
329.7Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record