| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials | Williams, Richard Ryan | 2018 |
| 2 | Lower Bounds by Algorithm Design: A Progress Report (Invited Paper) | Williams, Richard Ryan | 2018 |
| 3 | Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle | McKay, Dylan M. et al. | 2018 |
| 4 | The Orthogonal Vectors Conjecture for Branching Programs and Formulas | Kane, Daniel M. et al. | 2018 |
| 5 | Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation | Williams, Richard Ryan | 2016 |
| 6 | The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk) | Williams, Richard Ryan | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |