Pages that link to "Item:Q5122163"
From MaRDI portal
The following pages link to ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY (Q5122163):
Displaying 25 items.
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- (Q5009621) (← links)
- (Q5075784) (← links)
- (Q5088945) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- (Q5091161) (← links)
- (Q5116497) (← links)
- (Q5121902) (← links)
- (Q5140838) (← links)
- (Q5875463) (← links)
- (Q6065422) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)
- Communication and information complexity (Q6200329) (← links)
