Articoli con mandati relativi all'accesso pubblico - Guy KindlerUlteriori informazioni
Disponibili pubblicamente: 15
Towards a proof of the 2-to-1 games conjecture?
I Dinur, S Khot, G Kindler, D Minzer, M Safra
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandati: US National Science Foundation
On non-optimally expanding sets in Grassmann graphs
I Dinur, S Khot, G Kindler, D Minzer, M Safra
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandati: US National Science Foundation
Direct sum testing
R David, I Dinur, E Goldenberg, G Kindler, I Shinkar
Proceedings of the 2015 Conference on innovations in theoretical computer …, 2015
Mandati: European Commission
Invariance principle on the slice
Y Filmus, G Kindler, E Mossel, K Wimmer
ACM Transactions on Computation Theory (TOCT) 10 (3), 1-37, 2018
Mandati: US National Science Foundation, US Department of Defense
Hypercontractivity on the symmetric group
Y Filmus, G Kindler, N Lifshitz, D Minzer
Forum of Mathematics, Sigma 12, e6, 2024
Mandati: European Commission
Polynomially low error PCPs with polyloglog n queries via modular composition
I Dinur, P Harsha, G Kindler
Proceedings of the forty-seventh annual ACM symposium on theory of computing …, 2015
Mandati: European Commission
Gaussian noise sensitivity and Fourier tails
G Kindler, N Kirshner, R O’Donnell
Israel Journal of Mathematics 225, 71-109, 2018
Mandati: US National Science Foundation
Towards a proof of the fourier-entropy conjecture?
E Kelman, G Kindler, N Lifshitz, D Minzer, M Safra
Geometric and Functional Analysis 30 (4), 1097-1138, 2020
Mandati: US National Science Foundation, European Commission
Isoperimetric Inequalities Made Simpler
R Eldan, G Kindler, N Lifshitz, D Minzer
arXiv preprint arXiv:2204.06686, 2022
Mandati: US National Science Foundation
Approximation of non-boolean 2CSP
G Kindler, A Kolla, L Trevisan
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
Mandati: US National Science Foundation
Limits of preprocessing
Y Filmus, Y Ishai, A Kaplan, G Kindler
35th Computational Complexity Conference (CCC 2020), 2020
Mandati: US National Science Foundation, Department of Science & Technology, India …
Theorems of kkl, friedgut, and talagrand via random restrictions and log-sobolev inequality
E Kelman, S Khot, G Kindler, D Minzer, M Safra
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
Mandati: US National Science Foundation, European Commission
Concerns about recent claims of a huge quantum computational advantage via Gaussian boson sampling
G Kalai, G Kindler
preprint, 2021
Mandati: European Commission
Limits of Preprocessing
Y Filmus, Y Ishai, A Kaplan, G Kindler
computational complexity 33 (1), 5, 2024
Mandati: European Commission
Quantum automata cannot detect biased coins, even in the limit
R O’Donnell, G Kindler
Mandati: US National Science Foundation
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software