Longest increasing subsequence
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.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 increasing subsequence problem is solvable in time O(n log n), where n denotes the length of the input sequence.
Wikipage disambiguates
238 (number)Anatoly VershikBinary logarithmClique problemDeterminantal point processDynamic programmingErdős–Szekeres theoremFile comparisonHook length formulaLISList of algorithmsLongest alternating subsequenceLongest common subsequence problemLongest increasing subsequence problemLongest nondecreasing subsequenceMUMmerNondecreasing subsequenceOptimal substructurePatience sortingPerfect graphPermutation graphPlactic monoidPlancherel measureRobinson–Schensted correspondenceSorting algorithmStack-sortable permutationSubsequenceSuperpatternTracy–Widom distribution
Link from a Wikipage to another Wikipage
primaryTopic
Longest increasing subsequence
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.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 increasing subsequence problem is solvable in time O(n log n), where n denotes the length of the input sequence.
has abstract
Em ciência da computação, o pr ...... mento da seqüência de entrada.
@pt
En Ciencias de la Computación, ...... o de la secuencia de entrada.
@es
In computer science, the longe ...... length of the input sequence.
@en
In informatica, il problema de ...... ezza della sequenza originale.
@it
La recherche d'une plus longue ...... n) en la longueur de la suite.
@fr
Задача поиска наибольшей увели ...... последовательности элементов.
@ru
أطول متتالية جزئية متزايدة في ...... ، حيث n هو طول متتالية الدخل .
@ar
在计算机科学中，最长递增子序列（longest increa ...... O(n log n)的时间复杂度，这里n表示输入序列的规模。
@zh
컴퓨터 공학에서, 최장 증가 부분 수열(Longest ...... 가 n일 때 O(nlogn)의 시간에 풀이가 가능하다.
@ko
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,022,256,026
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Em ciência da computação, o pr ...... mento da seqüência de entrada.
@pt
En Ciencias de la Computación, ...... o de la secuencia de entrada.
@es
In computer science, the longe ...... length of the input sequence.
@en
In informatica, il problema de ...... ezza della sequenza originale.
@it
La recherche d'une plus longue ...... n) en la longueur de la suite.
@fr
Задача поиска наибольшей увели ...... последовательности элементов.
@ru
أطول متتالية جزئية متزايدة في ...... ، حيث n هو طول متتالية الدخل .
@ar
在计算机科学中，最长递增子序列（longest increa ...... O(n log n)的时间复杂度，这里n表示输入序列的规模。
@zh
컴퓨터 공학에서, 최장 증가 부분 수열(Longest ...... 가 n일 때 O(nlogn)의 시간에 풀이가 가능하다.
@ko
label
Longest increasing subsequence
@en
Massima sottosequenza crescente
@it
Máxima subsequência crescente
@pt
Plus longue sous-suite strictement croissante
@fr
Problema de la subsecuencia más larga
@es
Задача поиска наибольшей увеличивающейся подпоследовательности
@ru
أطول متتالية جزئية متزايدة
@ar
最长递增子序列
@zh
최장 증가 부분 수열
@ko