Show simple item record

dc.contributor.authorBlanc, Guy
dc.contributor.authorKoch, Caleb
dc.contributor.authorLange, Jane
dc.contributor.authorTan, Li-Yang
dc.date.accessioned2022-11-15T15:41:09Z
dc.date.available2022-11-15T15:41:09Z
dc.date.issued2022-06-09
dc.identifier.isbn978-1-4503-9264-8
dc.identifier.urihttps://hdl.handle.net/1721.1/146447
dc.publisherACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.relation.isversionofhttps://doi.org/10.1145/3519935.3519993en_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.sourceACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingen_US
dc.titleThe Query Complexity of Certificationen_US
dc.typeArticleen_US
dc.identifier.citationBlanc, Guy, Koch, Caleb, Lange, Jane and Tan, Li-Yang. 2022. "The Query Complexity of Certification."
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.updated2022-11-03T12:20:09Z
dc.language.rfc3066en
dc.rights.holderACM
dspace.date.submission2022-11-03T12:20:09Z
mit.licensePUBLISHER_POLICY
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