Obserwuj
Amir Yehudayoff
Amir Yehudayoff
Department of Mathematics, Technion
Zweryfikowany adres z technion.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Arithmetic circuits: A survey of recent results and open questions
A Shpilka, A Yehudayoff
Foundations and Trends® in Theoretical Computer Science 5 (3–4), 207-388, 2010
4292010
Lower bounds and separations for constant depth multilinear circuits
R Raz, A Yehudayoff
Computational Complexity 18 (2), 171-207, 2009
1282009
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
Z Dvir, A Shpilka, A Yehudayoff
SIAM Journal on Computing 39 (4), 1279-1293, 2010
872010
Pseudorandom generators for regular branching programs
M Braverman, A Rao, R Raz, A Yehudayoff
SIAM Journal on Computing 43 (3), 973-986, 2014
782014
Learnability can be undecidable
S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff
Nature Machine Intelligence 1 (1), 44-48, 2019
772019
Direct products in communication complexity
M Braverman, A Rao, O Weinstein, A Yehudayoff
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013
752013
Sample compression schemes for VC classes
S Moran, A Yehudayoff
Journal of the ACM (JACM) 63 (3), 1-10, 2016
742016
Learners that use little information
R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff
Algorithmic Learning Theory, 25-55, 2018
712018
Communication Complexity: and Applications
A Rao, A Yehudayoff
Cambridge University Press, 2020
682020
A lower bound for the size of syntactically multilinear arithmetic circuits
R Raz, A Shpilka, A Yehudayoff
SIAM Journal on Computing 38 (4), 1624-1647, 2008
632008
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
B Barak, Z Dvir, A Yehudayoff, A Wigderson
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
582011
Balancing syntactically multilinear arithmetic circuits
R Raz, A Yehudayoff
Computational Complexity 17 (4), 515-535, 2008
572008
Affine extractors over prime fields
A Yehudayoff
Combinatorica 31 (2), 245-256, 2011
532011
Non-commutative circuits and the sum-of-squares problem
P Hrubeš, A Wigderson, A Yehudayoff
Journal of the American Mathematical Society 24 (3), 871-898, 2011
522011
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
R Raz, A Yehudayoff
Journal of Computer and System Sciences 77 (1), 167-190, 2011
502011
Pseudorandomness for width-2 branching programs
A Bogdanov, Z Dvir, E Verbin, A Yehudayoff
Theory of Computing 9 (1), 283-293, 2013
452013
Homogeneous formulas and symmetric polynomials
P Hrubeš, A Yehudayoff
Computational Complexity 20 (3), 559-578, 2011
392011
Sign rank versus VC dimension
N Alon, S Moran, A Yehudayoff
Conference on Learning Theory, 47-80, 2016
362016
Expansion in SL 2 and monotone expanders
J Bourgain, A Yehudayoff
Geometric and Functional Analysis 23 (1), 1-41, 2013
362013
Direct product via round-preserving compression
M Braverman, A Rao, O Weinstein, A Yehudayoff
International Colloquium on Automata, Languages, and Programming, 232-243, 2013
342013
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20