( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge.

, и . TQC, том 135 из LIPIcs, стр. 2:1-2:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Shalev Ben-David

Shoham Ben-David

Josef Shalev

David Ben Titus Santosa

Ben Koch

 

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

A New Minimax Theorem for Randomized Algorithms., и . J. ACM, 70 (6): 38:1-38:58 (декабря 2023)A New Minimax Theorem for Randomized Algorithms, и . (2020)cite arxiv:2002.10802Comment: 57 pages.Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem., , , , и . STOC, стр. 1330-1342. ACM, (2021)Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge., и . TQC, том 135 из LIPIcs, стр. 2:1-2:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Symmetries, Graph Properties, and Quantum Speedups., , , , , и . FOCS, стр. 649-660. IEEE, (2020)On Query-to-Communication Lifting for Adversary Bounds., , и . CoRR, (2020)When Is Amplification Necessary for Composition in Randomized Query Complexity?, , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Unambiguous DNFs and Alon-Saks-Seymour., , , , и . FOCS, стр. 116-124. IEEE, (2021)Randomised Composition and Small-Bias Minimax., , , и . FOCS, стр. 624-635. IEEE, (2022)On Query-To-Communication Lifting for Adversary Bounds., , и . CCC, том 200 из LIPIcs, стр. 30:1-30:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)