Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
From MaRDI portal
Publication:5363082
DOI10.1137/1.9781611973730.16zbMath1372.68284OpenAlexW4243032598MaRDI QIDQ5363082
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/660b218f710df5ac0ecf33177e0792f8b4ca7cb7
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Boolean and Hadamard matrices (15B34)
Related Items (16)
A Sparsified Four-Russian Algorithm for RNA Folding ⋮ Fast Output-Sensitive Matrix Multiplication ⋮ Unnamed Item ⋮ An improved combinatorial algorithm for Boolean matrix multiplication ⋮ Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Internal masked prefix sums and its connection to fully internal measurement queries ⋮ Unnamed Item ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Improved subquadratic 3SUM ⋮ Unnamed Item ⋮ Data structures for categorical path counting queries ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication
This page was built for publication: Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
