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

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