( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
One-Way Communication Complexity and Non-Adaptive Decision Trees.

, , и . STACS, том 219 из LIPIcs, стр. 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Suhail Ghattas

Suhail Mahfud

Sherif Youssef Sherif

Suhail Debsi

Suhail Yousef

 

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

The Log-Approximate-Rank Conjecture Is False., , и . J. ACM, 67 (4): 23:1-23:28 (2020)The Log-Approximate-Rank Conjecture is False., , и . Electron. Colloquium Comput. Complex., (2018)The log-approximate-rank conjecture is false., , и . STOC, стр. 42-53. ACM, (2019)No quantum speedup over gradient descent for non-smooth convex optimization., , , и . CoRR, (2020)Lifting to Parity Decision Trees Via Stifling., , , и . CoRR, (2022)An improved protocol for ExactlyN with more than 3 players., , , , и . CoRR, (2023)No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization., , , и . ITCS, том 185 из LIPIcs, стр. 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness., , , и . NeurIPS, стр. 29874-29884. (2021)An Improved Protocol for ExactlyN with More Than 3 Players., , , , и . ITCS, том 287 из LIPIcs, стр. 58:1-58:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture., , и . Electron. Colloquium Comput. Complex., (2020)