( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Implicit Graph Conjecture is False.

, и . FOCS, стр. 1134-1137. IEEE, (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.

Fariba Hatami

Pooya Salehi

Ladan Pooyan-Weihs

Isaak Hatami

Naser Hatami

 

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

On the Structure of Quintic Polynomials.. APPROX-RANDOM, том 60 из LIPIcs, стр. 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)XOR lemmas for resilient functions against polynomials., , , , и . STOC, стр. 234-246. ACM, (2020)Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees., , , и . STOC, стр. 895-904. ACM, (2023)Higher-order Fourier Analysis and Applications., , и . Found. Trends Theor. Comput. Sci., 13 (4): 247-448 (2019)The Implicit Graph Conjecture is False., и . FOCS, стр. 1134-1137. IEEE, (2022)Paradigms for Unconditional Pseudorandom Generators., и . Found. Trends Theor. Comput. Sci., 16 (1-2): 1-210 (2024)Pseudorandom Generators for Low-Sensitivity Functions., и . Electron. Colloquium Comput. Complex., (2017)Measure preserving homomorphisms and independent sets in tensor graph powers., и . Discret. Math., 309 (4): 955-958 (2009)Structure in Communication Complexity and Constant-Cost Complexity Classes., и . Electron. Colloquium Comput. Complex., (2024)On Multilinear Forms: Bias, Correlation, and Tensor Rank., , , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 29:1-29:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)