The following pages link to (Q4607968):
Displaying 26 items.
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- Listing all fixed-length simple cycles in sparse graphs in optimal time (Q1679990) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- Circulant association schemes on triples (Q3380353) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- (Q5090377) (← links)
- (Q5091138) (← links)
- (Q5091155) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- (Q5874535) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- (Q6065422) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
- Leanness computation: small values and special graph classes (Q6606996) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)
- Fine-grained non-interactive key-exchange without idealized assumptions (Q6648207) (← links)
