( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hardness of Constant-Round Communication Complexity.

, , и . CCC, том 200 из LIPIcs, стр. 31:1-31:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Rahul Gupta

Rahul Dewan

Rahul Ray

Rahul Bahulikar

Rahul Rithe

 

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

The Non-hardness of Approximating Circuit Size., , и . Theory Comput. Syst., 65 (3): 559-578 (2021)Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity., , и . Electron. Colloquium Comput. Complex., (2021)The Minimum Formula Size Problem is (ETH) Hard.. FOCS, стр. 427-432. IEEE, (2021)The Non-hardness of Approximating Circuit Size., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2019)Hardness of Constant-Round Communication Complexity., , и . CCC, том 200 из LIPIcs, стр. 31:1-31:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic., , и . STOC, стр. 1076-1089. ACM, (2023)NP-Hardness of Circuit Minimization for Multi-Output Functions., , и . CCC, том 169 из LIPIcs, стр. 22:1-22:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Towards Separating Computational and Statistical Differential Privacy., , , , и . FOCS, стр. 580-599. IEEE, (2023)SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle.. FOCS, стр. 733-742. IEEE, (2023)A Duality between One-Way Functions and Average-Case Symmetry of Information., , , , и . STOC, стр. 1039-1050. ACM, (2023)