| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371) | Bläser, Markus et al. | 2023 |
| 2 | On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization | Shaltiel, Ronen et al. | 2022 |
| 3 | Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists) | Ron-Zewi, Noga et al. | 2021 |
| 4 | Is It Possible to Improve Yao’s XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? | Shaltiel, Ronen | 2020 |
| 5 | Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels | Shaltiel, Ronen et al. | 2016 |
| 6 | Pseudorandomness When the Odds are Against You | Artemenko, Sergei et al. | 2016 |
| 7 | Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract) | Applebaum, Benny et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |