| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On the Structure of Learnability Beyond P/Poly | Rajgopal, Ninad et al. | 2021 |
| 2 | Beyond Natural Proofs: Hardness Magnification and Locality | Chen, Lijie et al. | 2020 |
| 3 | Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds | Rajgopal, Ninad et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 3 |