( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Certification with an NP Oracle.

, , , , и . ITCS, том 251 из LIPIcs, стр. 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Caleb Mireri

Wolf Calebow

Wolf Calebow

Caleb Hughes

Caleb Wall

 

Другие публикации лиц с тем же именем

Certification with an NP Oracle., , , , и . CoRR, (2022)Superpolynomial Lower Bounds for Decision Tree Learning and Testing., , и . CoRR, (2022)Superpolynomial lower bounds for decision tree learning and testing., , и . SODA, стр. 1962-1994. SIAM, (2023)The query complexity of certification., , , и . STOC, стр. 623-636. ACM, (2022)Certification with an NP Oracle., , , , и . ITCS, том 251 из LIPIcs, стр. 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem., , , и . CoRR, (2024)Properly learning decision trees with queries is NP-hard., , и . FOCS, стр. 2383-2407. IEEE, (2023)A query-optimal algorithm for finding counterfactuals., , , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 2075-2090. PMLR, (2022)Superconstant Inapproximability of Decision Tree Learning., , и . COLT, том 247 из Proceedings of Machine Learning Research, стр. 2979-3010. PMLR, (2024)Automata Learning with an Incomplete Teacher., , , , , и . ECOOP, том 263 из LIPIcs, стр. 21:1-21:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)