Tensor ranks and the fine-grained complexity of dynamic programming
From MaRDI portal
Cites work
- A lower bound for the \(k\)-multicolored sum-free problem in \(\mathbb{Z}_m^n\)
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An Almost Linear Time Algorithm for Generalized Matrix Searching
- An equivalence class for orthogonal vectors
- An optimal visibility graph algorithm for triangulated simple polygons
- Bounds for matchings in nonabelian groups
- Breaking paragraphs into lines
- Catalan Numbers
- Computation of Matrix Chain Products. Part I
- Computation of Matrix Chain Products. Part II
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- scientific article; zbMATH DE number 1805583 (Why is no real title available?)
- scientific article; zbMATH DE number 7561763 (Why is no real title available?)
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 7788490 (Why is no real title available?)
- Implementation of the convex polygon triangulation algorithm
- Introduction to algorithms
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Limits on the universal method for matrix multiplication
- On cap sets and the group-theoretic approach to matrix multiplication
- On computing the length of longest increasing subsequences
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity
- On the hardness of approximate and exact (bichromatic) maximum inner product
- Optimum binary search trees
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Quadratic conditional lower bounds for string problems and dynamic time warping
- Sequence comparison with concave weighting functions
- Slice rank of block tensors and irreversibility of structure tensors of algebras
- Speeding up dynamic programming with applications to molecular biology
- Subcubic equivalences between path, matrix, and triangle problems
- The concave least-weight subsequence problem revisited
- The Least Weight Subsequence Problem
- Tight hardness results for LCS and other sequence similarity measures
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
- Which regular expression patterns are hard to match?
- Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails
This page was built for publication: Tensor ranks and the fine-grained complexity of dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906438)
