| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On the Fine-Grained Complexity of Parity Problems | Abboud, Amir et al. | 2020 |
| 2 | Scheduling Lower Bounds via AND Subset Sum | Abboud, Amir et al. | 2020 |
| 3 | Faster Algorithms for All-Pairs Bounded Min-Cuts | Abboud, Amir et al. | 2019 |
| 4 | Fine-Grained Reductions and Quantum Speedups for Dynamic Programming | Abboud, Amir | 2019 |
| 5 | Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds | Abboud, Amir et al. | 2018 |
| 6 | Tighter Connections Between Formula-SAT and Shaving Logs | Abboud, Amir et al. | 2018 |
| 7 | Towards Hardness of Approximation for Polynomial Time Problems | Abboud, Amir et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |