( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Randomized versus Deterministic Decision Tree Size.

, , , , и . STOC, стр. 867-880. ACM, (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.

Monamie Sanyal

Raman Sanyal

Bhaskar Sanyal

 

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

Linear Sketching over F_2., , , и . CCC, том 102 из LIPIcs, стр. 8:1-8:37. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Parity Decision Trees for Fourier-Sparse Boolean Functions., и . FSTTCS, том 182 из LIPIcs, стр. 29:1-29:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Communication Complexity of Finding a King in a Tournament., , , и . APPROX/RANDOM, том 317 из LIPIcs, стр. 64:1-64:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity.. ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 1035-1045. Springer, (2015)Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity.. Electron. Colloquium Comput. Complex., (2014)Randomized versus Deterministic Decision Tree Size., , , , и . STOC, стр. 867-880. ACM, (2023)A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity., , , и . ICALP, том 132 из LIPIcs, стр. 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A composition theorem for randomized query complexity via max conflict complexity., , , и . CoRR, (2018)On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids, , и . CoRR, (2009)The Zero-Error Randomized Query Complexity of the Pointer Function., и . FSTTCS, том 65 из LIPIcs, стр. 16:1-16:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)