Show simple item record

dc.contributor.authorBhangale, Amey
dc.contributor.authorKhot, Subhash
dc.contributor.authorMinzer, Dor
dc.date.accessioned2022-10-12T17:15:02Z
dc.date.available2022-10-12T17:15:02Z
dc.date.issued2022
dc.identifier.urihttps://hdl.handle.net/1721.1/145803
dc.language.isoen
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionof10.1145/3519935.3520028en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceACMen_US
dc.titleOn approximability of satisfiable k -CSPs: Ien_US
dc.typeArticleen_US
dc.identifier.citationBhangale, Amey, Khot, Subhash and Minzer, Dor. 2022. "On approximability of satisfiable k -CSPs: I." Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing.
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.relation.journalProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
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.updated2022-10-12T16:53:58Z
dspace.orderedauthorsBhangale, A; Khot, S; Minzer, Den_US
dspace.date.submission2022-10-12T16:53:59Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record