( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
XOR lemmas for resilient functions against polynomials.

, , , , и . STOC, стр. 234-246. ACM, (2020)

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.

Afshin Hosseini

Mahmoud Hosseini

Hadi Hosseini

Mehdi Hosseini

Alireza Hosseini

 

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

Structure of Protocols for XOR Functions., , и . FOCS, стр. 282-288. IEEE Computer Society, (2016)Pseudorandom Generators from Polarizing Random Walks., , , и . CCC, том 102 из LIPIcs, стр. 1:1-1:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Affine-malleable extractors, spectrum doubling, and application to privacy amplification., , и . ISIT, стр. 2913-2917. IEEE, (2016)Structure and Randomness in Complexity Theory and Additive Combinatorics.. University of California, San Diego, USA, (2019)Sign Rank vs Discrepancy., , и . CCC, том 169 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Torus Polynomials: An Algebraic Approach to ACC Lower Bounds., , , и . ITCS, том 124 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Online Learning and Disambiguations of Partial Concept Classes., , , и . ICALP, том 261 из LIPIcs, стр. 42:1-42:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications., , и . STOC, стр. 463-471. ACM, (2023)Separation of the Factorization Norm and Randomized Communication Complexity., , , и . CCC, том 264 из LIPIcs, стр. 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification., , и . IACR Cryptology ePrint Archive, (2015)