No. Title Author Year
1 Can You Solve Closest String Faster Than Exhaustive Search? Abboud, Amir et al. 2023
2 A Structural Investigation of the Approximability of Polynomial-Time Problems 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
5 Faster Minimization of Tardy Processing Time on a Single Machine Bringmann, Karl et al. 2020
6 A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties Bringmann, Karl et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI