Show simple item record

Properly learning decision trees in almost polynomial time

dc.contributor.authorBlanc, Guy
dc.contributor.authorLange, Jane
dc.contributor.authorQiao, Mingda
dc.contributor.authorTan, Li-Yang
dc.date.accessioned2022-11-14T19:54:13Z
dc.date.available2022-11-14T19:54:13Z
dc.date.issued2022-09-02
dc.identifier.issn0004-5411
dc.identifier.urihttps://hdl.handle.net/1721.1/146413
dc.publisherACMen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/3561047en_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.sourceACMen_US
dc.titleProperly learning decision trees in almost polynomial timeen_US
dc.typeArticleen_US
dc.identifier.citationBlanc, Guy, Lange, Jane, Qiao, Mingda and Tan, Li-Yang. 2022. "Properly learning decision trees in almost polynomial time." Journal of the ACM.
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.relation.journalJournal of the ACMen_US
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-11-03T12:08:48Z
dc.language.rfc3066en
dc.rights.holderACM
dspace.date.submission2022-11-03T12:08:48Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Name:
3561047.pdf
Size:
293.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record