No. Title Author Year
1 On the Number of Quantifiers as a Complexity Measure Fagin, Ronald et al. 2022
2 Optimal Fine-Grained Hardness of Approximation of Linear Equations Bafna, Mitali et al. 2021
3 Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs Lincoln, Andrea et al. 2020
4 Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms Vyas, Nikhil et al. 2020
5 Near-Optimal Complexity Bounds for Fragments of the Skolem Problem Akshay, S. et al. 2020
6 Approximation Algorithms for Min-Distance Problems Dalirrooyfard, Mina et al. 2019
7 Imperfect Gaps in Gap-ETH and PCPs Bafna, Mitali et al. 2019
8 Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems Dalirrooyfard, Mina et al. 2019
9 Complexity of Restricted Variants of Skolem and Related Problems S., Akshay et al. 2017
10 On Regularity of Unary Probabilistic Automata Akshay, S. et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 10


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