\((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
type: Item
instance of: scholarly article
title: \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
DOI: 10.1007/978-3-031-49193-1_5
author: Andrzej Lingas
author: Mia Persson
publication date: 2024-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7900432
MaRDI profile type: Publication
cites work: Q6147281
cites work: On the exponent of all pairs shortest path problem
cites work: Faster knapsack algorithms via bounded monotone min-plus-convolution
cites work: Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
cites work: Necklaces, convolutions, and \(X+Y\)
cites work: Q5874497
cites work: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
cites work: On Problems Equivalent to (min,+)-Convolution
cites work: Faster algorithms for finding lowest common ancestors in directed acyclic graphs
cites work: Q4055156
cites work: Approximating minimum cocolorings.
cites work: Powers of tensors and fast matrix multiplication
cites work: Q4607951
cites work: Fast rectangular matrix multiplication and applications
cites work: Extreme witnesses and their applications
cites work: A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
cites work: Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
cites work: Faster all-pairs shortest paths via circuit complexity
cites work: Q4633908
cites work: An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
description: scientific article; zbMATH DE number 7900432