scientific article; zbMATH DE number 7051265
From MaRDI portal
Publication:4633908
zbMath1423.68575MaRDI QIDQ4633908
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496873
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Randomized algorithms (68W20)
Related Items (6)
Efficient parameterized algorithms for computing all-pairs shortest paths ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Hamming Distance Completeness ⋮ Dominance Product and High-Dimensional Closest Pair under L_infty
This page was built for publication:
