| Finding Errorless Pessiland in Error-Prone Heuristica | 0 | 0.34 | 2022 |
| NP-Hardness of Learning Programs and Partial MCSP | 1 | 0.36 | 2022 |
| Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. | 0 | 0.34 | 2022 |
| Errorless Versus Error-Prone Average-Case Complexity. | 0 | 0.34 | 2022 |
| Excluding PH Pessiland. | 0 | 0.34 | 2022 |
| Meta-Computational Average-Case Complexity: A New Paradigm Toward Excluding Heuristica. | 0 | 0.34 | 2022 |
| Symmetry of Information from Meta-Complexity | 0 | 0.34 | 2022 |
| Hardness Self-Amplification from Feasible Hard-Core Sets | 1 | 0.36 | 2022 |
| Hardness of Constant-Round Communication Complexity. | 0 | 0.34 | 2021 |
| Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. | 0 | 0.34 | 2021 |
| On Worst-Case Learning in Relativized Heuristica | 0 | 0.34 | 2021 |
| Test of Quantumness with Small-Depth Quantum Circuits. | 0 | 0.34 | 2021 |
| Average-case hardness of NP from exponential worst-case hardness assumptions | 0 | 0.34 | 2021 |
| One-Tape Turing Machine And Branching Program Lower Bounds For Mcsp | 0 | 0.34 | 2021 |
| Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH | 1 | 0.35 | 2021 |
| Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. | 0 | 0.34 | 2020 |
| Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits | 0 | 0.34 | 2020 |
| Unexpected hardness results for Kolmogorov complexity under uniform reductions | 0 | 0.34 | 2020 |
| Unexpected Power of Random Strings. | 0 | 0.34 | 2020 |
| Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity | 0 | 0.34 | 2020 |
| Beyond Natural Proofs: Hardness Magnification and Locality. | 0 | 0.34 | 2019 |
| Identifying an Honest EXP^NP Oracle Among Many. | 0 | 0.34 | 2015 |
