Longest increasing subsequence
id:
longest-increasing-subsequence-312-11775243
title:
Longest increasing subsequence
text:
In computer science, the longest increasing subsequence problem aims to find a subsequence of a given sequence in which the subsequence's elements are sorted in an ascending order and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique. The longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics. The longest incre
brand slug:
wiki
category slug:
encyclopedia
description:
Computer science problem
original url:
https://en.wikipedia.org/wiki/Longest_increasing_subsequence
date created:
date modified:
2024-04-17T06:38:09Z
main entity:
{"identifier":"Q4183855","url":"https://www.wikidata.org/entity/Q4183855"}
image:
fields total:
13
integrity:
14