Author of the publication

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)

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

Communication and Memory Efficient Testing of Discrete Distributions., , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 1070-1106. PMLR, (2019)Probabilistic Existence of Large Sets of Designs., , and . SODA, page 1545-1556. SIAM, (2018)The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes., , and . SIAM J. Comput., 48 (4): 1425-1435 (2019)On the Number of Distinct k-Decks: Enumeration and Bounds., , , , , and . ISCIT, page 519-524. IEEE, (2019)The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes., , and . FOCS, page 252-259. IEEE Computer Society, (2017)Probabilistic existence of large sets of designs., , and . J. Comb. Theory A, (2020)Lower Bound on the Redundancy of PIR Codes., and . CoRR, (2016)Labeling the complete bipartite graph with no zero cycles., , and . Electron. Colloquium Comput. Complex., (2017)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)A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n., and . CCC, volume 102 of LIPIcs, page 2:1-2:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)