| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Structural Investigation of the Approximability of Polynomial-Time Problems | Bringmann, Karl et al. | 2022 |
| 2 | Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution | Bringmann, Karl et al. | 2022 |
| 3 | Improved Sublinear-Time Edit Distance for Preprocessed Strings | Bringmann, Karl et al. | 2022 |
| 4 | Fine-Grained Completeness for Optimization in P | Bringmann, Karl et al. | 2021 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |