( en | de | ru )

 

Disambiguation of "Lovett, Shachar"

Author of the publication

copydeleteadd this publication to your clipboard
Large Supports are Required for Well-Supported Nash Equilibria.

, , , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 78-84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

Tom Lovett

Brendan Lovett

 

Other publications of authors with the same name

Subspace evasive sets., and . STOC, page 351-358. ACM, (2012)Holes in generalized Reed-Muller codes.. IEEE Trans. Inf. Theory, 56 (6): 2583-2586 (2010)The Complexity of Boolean Functions in Different Characteristics., , and . Comput. Complex., 19 (2): 235-263 (2010)Labeling the complete bipartite graph with no zero cycles., , and . Electron. Colloquium Comput. Complex., (2017)High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games., , and . Electron. Colloquium Comput. Complex., (2020)Improved bounds for the sunflower lemma., , , and . Electron. Colloquium Comput. Complex., (2019)Torus Polynomials: An Algebraic Approach to ACC Lower Bounds., , , and . ITCS, volume 124 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Worst Case to Average Case Reductions for Polynomials., and . FOCS, page 166-175. IEEE Computer Society, (2008)Computational-Statistical Gap in Reinforcement Learning., , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 1282-1302. PMLR, (2022)Exponential Hardness of Reinforcement Learning with Linear Function Approximation., , , , , and . COLT, volume 195 of Proceedings of Machine Learning Research, page 1588-1617. PMLR, (2023)