Author of the publication

Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation.

, , , and . SIAM J. Comput., 46 (1): 114-131 (2017)

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

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly., and . TOCT, 7 (4): 16:1-16:13 (2015)The direct sum of universal relations.. Inf. Process. Lett., (2018)On the rectangle method in proofs of robustness of tensor products.. Inf. Process. Lett., 112 (6): 257-260 (2012)Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling., , , and . Computational Complexity Conference, volume 137 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly., and . Electron. Colloquium Comput. Complex., (2011)On the Efficiency of Non-Uniform PCPP Verifiers.. Electron. Colloquium Comput. Complex., (2008)Combinatorial Construction of Locally Testable Codes.. Electron. Colloquium Comput. Complex., (2007)IP = PSPACE using Error Correcting Codes.. Electron. Colloquium Comput. Complex., (2010)IP = PSPACE Using Error-Correcting Codes.. SIAM J. Comput., 42 (1): 380-403 (2013)Combinatorial PCPs with Efficient Verifiers.. FOCS, page 463-471. IEEE Computer Society, (2009)