From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.

E. Kelman, S. Khot, G. Kindler, D. Minzer, и M. Safra. ITCS, том 185 из LIPIcs, стр. 26:1-26:17. 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.

Klaus Mulisch

Robert Safran

Menachem Beir Safram

Valens Mulindabigwi

Herbert Mulisch

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

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.E. Kelman, S. Khot, G. Kindler, D. Minzer, и M. Safra. Electron. Colloquium Comput. Complex., (2020)Approximating the Influence of Monotone Boolean Functions in $O(n)$ Query Complexity.D. Ron, R. Rubinfeld, M. Safra, и O. Weinstein. APPROX-RANDOM, том 6845 из Lecture Notes in Computer Science, стр. 664-675. Springer, (2011)Ranged hash functions and the price of churn.J. Aspnes, M. Safra, и Y. Yin. SODA, стр. 1066-1075. SIAM, (2008)Small Set Expansion in The Johnson Graph.S. Khot, D. Minzer, D. Moshkovitz, и M. Safra. Electron. Colloquium Comput. Complex., (2018)On independent sets, 2-to-2 games, and Grassmann graphs.S. Khot, D. Minzer, и M. Safra. STOC, стр. 576-589. ACM, (2017)Hardness Amplification for Errorless Heuristics.A. Bogdanov, и M. Safra. FOCS, стр. 418-426. IEEE Computer Society, (2007)On Non-Approximability for Quadratic Programs.S. Arora, E. Berger, E. Hazan, G. Kindler, и M. Safra. FOCS, стр. 206-215. IEEE Computer Society, (2005)Towards a Proof of the Fourier-Entropy Conjecture?E. Kelman, G. Kindler, N. Lifshitz, D. Minzer, и M. Safra. FOCS, стр. 247-258. IEEE, (2020)Towards an optimal query efficient PCP?S. Khot, M. Safra, и M. Tulsiani. ITCS, стр. 173-186. ACM, (2013)Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion.S. Khot, D. Minzer, и M. Safra. FOCS, стр. 592-601. IEEE Computer Society, (2018)

BibSonomy

Disambiguation