Show simple item record

Lattice Problems beyond Polynomial Time

dc.contributor.authorAggarwal, Divesh
dc.contributor.authorBennett, Huck
dc.contributor.authorBrakerski, Zvika
dc.contributor.authorGolovnev, Alexander
dc.contributor.authorKumar, Rajendra
dc.contributor.authorLi, Zeyong
dc.contributor.authorPeters, Spencer
dc.contributor.authorStephens-Davidowitz, Noah
dc.contributor.authorVaikuntanathan, Vinod
dc.date.accessioned2023-07-06T20:29:40Z
dc.date.available2023-07-06T20:29:40Z
dc.date.issued2023-06-02
dc.identifier.isbn978-1-4503-9913-5
dc.identifier.urihttps://hdl.handle.net/1721.1/151009
dc.publisherACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3564246.3585227en_US
dc.rightsArticle 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.sourceAssociation for Computing Machineryen_US
dc.titleLattice Problems beyond Polynomial Timeen_US
dc.typeArticleen_US
dc.identifier.citationAggarwal, Divesh, Bennett, Huck, Brakerski, Zvika, Golovnev, Alexander, Kumar, Rajendra et al. 2023. "Lattice Problems beyond Polynomial Time."
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicensePUBLISHER_POLICY
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:30Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2023-07-01T07:51:30Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Name:
3564246.3585227.pdf
Size:
5.347Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record