Author of the publication

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.

, , , , and . Electronic Colloquium on Computational Complexity (ECCC), (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

Lower Bounds for Matrix Factorization., and . CoRR, (2019)Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits., , and . Theory of Computing, 14 (1): 1-45 (2018)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , and . TOCT, 10 (1): 3:1-3:30 (2018)Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits., , and . Computational Complexity Conference, volume 102 of LIPIcs, page 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas., , and . Computational Complexity, 25 (2): 455-505 (2016)Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas., , and . CoRR, (2014)On the Structure of Boolean Functions with Small Spectral Norm, and . CoRR, (2013)Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs., , , , and . CoRR, (2015)Efficiently Decoding Reed-Muller Codes From Random Errors., , and . IEEE Trans. Information Theory, 63 (4): 1954-1960 (2017)A Quadratic Lower Bound for Algebraic Branching Programs., , , and . CoRR, (2019)