Author of the publication

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

Quantum versus Randomized Communication Complexity, with Efficient Players., , and . Comput. Complex., 31 (2): 17 (2022)Oracle Separation of BQP and PH., and . J. ACM, 69 (4): 30:1-30:21 (2022)Computing Requires Larger Formulas than Approximating.. Electron. Colloquium Comput. Complex., (2016)Time-Space Hardness of Learning Sparse Parities., , and . Electron. Colloquium Comput. Complex., (2016)Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees., , , and . Electron. Colloquium Comput. Complex., (2022)Fooling Constant-Depth Threshold Circuits., , , and . Electron. Colloquium Comput. Complex., (2021)Matrix Rigidity of Random Toeplitz Matrices., and . Electron. Colloquium Comput. Complex., (2015)Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs., , , and . FOCS, page 858-869. IEEE, (2020)Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem., , , , and . STOC, page 1330-1342. ACM, (2021)Tight Bounds on the Fourier Spectrum of AC0.. CCC, volume 79 of LIPIcs, page 15:1-15:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)