Follow
Avishay Tal
Title
Cited by
Cited by
Year
Oracle Separation of BQP and PH
R Raz, A Tal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
1292019
Tight bounds on the Fourier spectrum of AC0
A Tal
32nd Computational Complexity Conference (CCC 2017), 2017
1092017
Shrinkage of De Morgan formulae by spectral techniques
A Tal
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 551-560, 2014
83*2014
Properties and applications of boolean function composition
A Tal
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
752013
Improved average-case lower bounds for demorgan formula size
I Komargodski, R Raz, A Tal
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 588-597, 2013
65*2013
Extractor-based time-space lower bounds for learning
S Garg, R Raz, A Tal
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
622018
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
AB Watts, R Kothari, L Schaeffer, A Tal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
592019
Time-space hardness of learning sparse parities
G Kol, R Raz, A Tal
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
542017
Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem
S Aaronson, S Ben-David, R Kothari, S Rao, A Tal
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
53*2021
Pseudorandom generators for width-3 branching programs
R Meka, O Reingold, A Tal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
472019
Degree and sensitivity: tails of two distributions
P Gopalan, R Servedio, A Tal, A Wigderson
arXiv preprint arXiv:1604.07432, 2016
452016
On the structure of boolean functions with small spectral norm
A Shpilka, A Tal, BL Volk
computational complexity 26 (1), 229-273, 2017
412017
Two structural results for low degree polynomials and applications
G Cohen, A Tal
arXiv preprint arXiv:1404.0654, 2014
402014
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates
E Chattopadhyay, P Hatami, S Lovett, A Tal
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
392018
Improved pseudorandomness for unordered branching programs through local monotonicity
E Chattopadhyay, P Hatami, O Reingold, A Tal
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
352018
AC0 [p] lower bounds against MCSP via the coin problem
A Golovnev, R Ilango, R Impagliazzo, V Kabanets, A Kolokolova, A Tal
ICALP, 2019
332019
On fractional block sensitivity
R Kulkarni, A Tal
Chicago J. Theor. Comput. Sci 8, 1-16, 2016
332016
Rigid matrices from rectangular pcps or: Hard claims have complex proofs
A Bhangale, P Harsha, O Paradise, A Tal
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
312020
Matrix rigidity of random Toeplitz matrices
O Goldreich, A Tal
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
302016
Low-sensitivity functions from unambiguous certificates
S Ben-David, P Hatami, A Tal
arXiv preprint arXiv:1605.07084, 2016
302016
The system can't perform the operation now. Try again later.
Articles 1–20