Longest increasing subsequence

From Wikipedia, the free encyclopedia

You have new messages (last change).

A longest increasing subsequence of a partially ordered sequence is studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics.

[edit] See also

 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../l/o/n/Longest_increasing_subsequence.html"