( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A New Minimax Theorem for Randomized Algorithms

, и . (2020)cite arxiv:2002.10802Comment: 57 pages.

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.

Jean-Yves Blaise

Kurt Blaise

Herbert Blaise

Rolf Maria Blaise

Joseph-Francklin Blaise

 

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

The Information Complexity of Hamming Distance., , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 465-489. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Approximating Boolean Functions with Depth-2 Circuits., и . CCC, стр. 74-85. IEEE Computer Society, (2013)Lower Bounds for Testing Function Isomorphism., и . CCC, стр. 235-246. IEEE Computer Society, (2010)Partially Symmetric Functions Are Efficiently Isomorphism-Testable., , и . FOCS, стр. 551-560. IEEE Computer Society, (2012)Learning and Testing Junta Distributions., , и . COLT, том 49 из JMLR Workshop and Conference Proceedings, стр. 19-46. JMLR.org, (2016)Box Covers and Domain Orderings for Beyond Worst-Case Join Processing., , и . ICDT, том 186 из LIPIcs, стр. 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Testing submodularity and other properties of valuation functions., и . CoRR, (2016)Partially Symmetric Functions are Efficiently Isomorphism-Testable, , и . CoRR, (2011)Improved Bounds for Testing Juntas.. APPROX-RANDOM, том 5171 из Lecture Notes in Computer Science, стр. 317-330. Springer, (2008)VC dimension and distribution-free sample-based testing., , и . STOC, стр. 504-517. ACM, (2021)