Author of the publication

Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds.

, and . CCC, volume 33 of LIPIcs, page 72-87. 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.

 

Other publications of authors with the same name

New bounds for matching vector families., , and . STOC, page 823-832. ACM, (2013)Rectangles Are Nonnegative Juntas., , , , and . Electron. Colloquium Comput. Complex., (2014)List decoding Reed-Muller codes over small fields., and . Electron. Colloquium Comput. Complex., (2014)Generalized comparison trees for point-location problems., , and . Electron. Colloquium Comput. Complex., (2018)Equivalence of polynomial conjectures in additive combinatorics.. Comb., 32 (5): 607-618 (2012)On the Beck-Fiala conjecture for random set systems., and . Random Struct. Algorithms, 54 (4): 665-675 (2019)On the Beck-Fiala Conjecture for Random Set Systems., and . APPROX-RANDOM, volume 60 of LIPIcs, page 29:1-29:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Random Low Degree Polynomials are Hard to Approximate., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 366-377. Springer, (2009)Decision list compression by mild random restrictions., , and . STOC, page 247-254. ACM, (2020)Improved bounds for the sunflower lemma., , , and . STOC, page 624-630. ACM, (2020)