Avishay Tal

发表

The choice and agreement problems of a random function

Or Meir, Avishay Tal, 2018, Inf. Process. Lett..

#SAT Algorithms from Shrinkage

Avishay Tal, 2015, Electron. Colloquium Comput. Complex..

Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem pdf

Avishay Tal, Scott Aaronson, Shalev Ben-David, 2020, STOC.

Time-space hardness of learning sparse parities

Ran Raz, Avishay Tal, Gillat Kol, 2017, Electron. Colloquium Comput. Complex..

Quantum versus Randomized Communication Complexity, with Efficient Players

Ran Raz, Avishay Tal, Uma Girish, 2019, computational complexity.

Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs pdf

Avishay Tal, Amey Bhangale, Prahladh Harsha, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Quantum Implications of Huang's Sensitivity Theorem

Avishay Tal, Scott Aaronson, Shalev Ben-David, 2020, Electron. Colloquium Comput. Complex..

The Bipartite Formula Complexity of Inner-Product is Quadratic

Avishay Tal, 2016, Electron. Colloquium Comput. Complex..

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0 pdf

Or Meir, Avishay Tal, Yuval Filmus, 2020, ArXiv.

On Fractional Block Sensitivity

Avishay Tal, Raghav Kulkarni, Avishay Tal, 2013, Chic. J. Theor. Comput. Sci..

Time-space lower bounds for two-pass learning

Ran Raz, Avishay Tal, Sumegha Garg, 2019, Electron. Colloquium Comput. Complex..

On the Computational Power of Radio Channels

Avishay Tal, Gillat Kol, Mark Braverman, 2019, DISC.

The Robust Sensitivity of Boolean Functions

Shachar Lovett, Avishay Tal, Jiapeng Zhang, 2018, SODA.

On the Structure of Boolean Functions with Small Spectral Norm

Avishay Tal, Amir Shpilka, Ben lee Volk, 2015, computational complexity.

Improved Average-Case Lower Bounds for DeMorgan Formula Size

Ran Raz, Avishay Tal, Ilan Komargodski, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Towards Optimal Separations between Quantum and Randomized Query Complexities

Avishay Tal, Avishay Tal, 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Oracle separation of BQP and PH

Ran Raz, Avishay Tal, R. Raz, 2019, Electron. Colloquium Comput. Complex..

On the Sensitivity Conjecture

Avishay Tal, 2016, ICALP.

On the minimal fourier degree of symmetric Boolean functions

Avishay Tal, Amir Shpilka, Amir Shpilka, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Shrinkage of De Morgan Formulae by Spectral Techniques

Avishay Tal, Avishay Tal, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Cubic Formula Size Lower Bounds Based on Compositions with Majority

Avishay Tal, Anna Gál, Adrian Trejo Nuñez, 2018, Electron. Colloquium Comput. Complex..

Tight bounds on The Fourier Spectrum of AC0

Avishay Tal, Avishay Tal, 2017, Electron. Colloquium Comput. Complex..

Lower Bounds for 2-Query LCCs over Large Alphabet

Arnab Bhattacharyya, Avishay Tal, Sivakanth Gopi, 2017, APPROX-RANDOM.

Matrix rigidity of random Toeplitz matrices

Avishay Tal, Oded Goldreich, Avishay Tal, 2016, computational complexity.

Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs

Avishay Tal, Amey Bhangale, Prahladh Harsha, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

On the degree of univariate polynomials over the integers

Avishay Tal, Gil Cohen, Amir Shpilka, 2012, ITCS '12.

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates

Shachar Lovett, Avishay Tal, Pooya Hatami, 2018, Electron. Colloquium Comput. Complex..

On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions

Avishay Tal, Oded Goldreich, Oded Goldreich, 2017, Electron. Colloquium Comput. Complex..

Formula lower bounds via the quantum method

Avishay Tal, Avishay Tal, 2017, STOC.

Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

Avishay Tal, Luke Schaeffer, Robin Kothari, 2019, STOC.

Computing Requires Larger Formulas than Approximating

Avishay Tal, Avishay Tal, 2016, Electron. Colloquium Comput. Complex..

On the minimal fourier degree of symmetric Boolean functions

Avishay Tal, Amir Shpilka, 2014, Comb..

Pseudorandom generators for width-3 branching programs

Avishay Tal, Omer Reingold, Raghu Meka, 2018, Electron. Colloquium Comput. Complex..

Pseudorandom Generators for Low-Sensitivity Functions

Avishay Tal, Pooya Hatami, 2017, Electron. Colloquium Comput. Complex..

Properties and applications of boolean function composition

Avishay Tal, Avishay Tal, 2013, ITCS '13.

Degree and Sensitivity: tails of two distributions

Avishay Tal, Avi Wigderson, Parikshit Gopalan, 2016, Electron. Colloquium Comput. Complex..

Matrix rigidity of random toeplitz matrices

Avishay Tal, Oded Goldreich, 2016, STOC.

Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound

Ran Raz, Avishay Tal, Ilan Komargodski, 2017, SIAM J. Comput..

Improved pseudorandomness for unordered branching programs through local monotonicity

Avishay Tal, Omer Reingold, Pooya Hatami, 2017, Electron. Colloquium Comput. Complex..

AC0[p] Lower Bounds against MCSP via the Coin Problem

Avishay Tal, Russell Impagliazzo, Valentine Kabanets, 2019, Electron. Colloquium Comput. Complex..

On the degree of univariate polynomials over the integers

Avishay Tal, Gil Cohen, Amir Shpilka, 2017, Comb..

Shrinkage of De Morgan Formulae from Quantum Query Complexity

Avishay Tal, 2014, Electron. Colloquium Comput. Complex..

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for $\mathbf{AC}^0$

Or Meir, Avishay Tal, Yuval Filmus, 2020, Electron. Colloquium Comput. Complex..

Two Structural Results for Low Degree Polynomials and Applications pdf

Avishay Tal, Gil Cohen, Avishay Tal, 2014, Electron. Colloquium Comput. Complex..

Extractor-based time-space lower bounds for learning

Ran Raz, Avishay Tal, Sumegha Garg, 2017, Electron. Colloquium Comput. Complex..

Pseudorandom Generators for Read-Once Monotone Branching Programs

Avishay Tal, Omer Reingold, Dean Doron, 2021, APPROX-RANDOM.

Fooling Constant-Depth Threshold Circuits

Avishay Tal, Pooya Hatami, Roei Tell, 2021, Electron. Colloquium Comput. Complex..

Monotone Branching Programs: Pseudorandomness and Circuit Complexity

Avishay Tal, Omer Reingold, Dean Doron, 2021, Electron. Colloquium Comput. Complex..

Fourier growth of parity decision trees

Avishay Tal, Uma Girish, Kewen Wu, 2021, Empir. Softw. Eng..

Junta distance approximation with sub-exponential queries

Avishay Tal, Michael Whitmeyer, Vishnu Iyer, 2021, Electron. Colloquium Comput. Complex..