Path algebra algorithm for finding longest increasing subsequence
classification
💻 cs.DS
keywords
algorithmfindingincreasinglongestalgebraidempotentsubsequencediscussed
read the original abstract
New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematics and uses Max-Plus idempotent semiring. Problem of finding longest increasing sub- sequence is reformulated in a matrix form and solved with linear algebra.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.