Author of the publication

Towards NEXP versus BPP?

. CSR, volume 7913 of Lecture Notes in Computer Science, page 174-182. Springer, (2013)

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

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)., , , and . Dagstuhl Reports, 3 (8): 40-72 (2013)Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants., , and . Algorithmica, 81 (10): 4010-4028 (2019)On Uniformity and Circuit Lower Bounds., and . Comput. Complex., 23 (2): 177-205 (2014)Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of $\#$SAT Algorithms., and . CoRR, (2020)Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits., and . Electron. Colloquium Comput. Complex., (2015)A VLSI Circuit Model Accounting For Wire Delay., , and . Electron. Colloquium Comput. Complex., (2023)Self-Improvement for Circuit-Analysis Problems.. Electron. Colloquium Comput. Complex., (2023)Limits on Alternation-Trading Proofs for Time-Space Lower Bounds., and . Electron. Colloquium Comput. Complex., (2011)Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity., , , , and . Electron. Colloquium Comput. Complex., (2021)Moby: A Blackout-Resistant Anonymity Network for Mobile Devices., , , , , , and . Proc. Priv. Enhancing Technol., 2022 (3): 247-267 (2022)