Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_increasing_subsequence> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Longest_increasing_subsequence abstract "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.".
- Longest_increasing_subsequence wikiPageExternalLink Longest_Increasing_Subsequence.
- Longest_increasing_subsequence wikiPageExternalLink 9591.
- Longest_increasing_subsequence wikiPageID "4587078".
- Longest_increasing_subsequence wikiPageRevisionID "603153811".
- Longest_increasing_subsequence hasPhotoCollection Longest_increasing_subsequence.
- Longest_increasing_subsequence subject Category:Combinatorics.
- Longest_increasing_subsequence subject Category:Dynamic_programming.
- Longest_increasing_subsequence subject Category:Formal_languages.
- Longest_increasing_subsequence subject Category:Problems_on_strings.
- Longest_increasing_subsequence type Abstraction100002137.
- Longest_increasing_subsequence type Attribute100024264.
- Longest_increasing_subsequence type Communication100033020.
- Longest_increasing_subsequence type Condition113920835.
- Longest_increasing_subsequence type Difficulty114408086.
- Longest_increasing_subsequence type FormalLanguages.
- Longest_increasing_subsequence type Language106282651.
- Longest_increasing_subsequence type Problem114410605.
- Longest_increasing_subsequence type ProblemsOnStrings.
- Longest_increasing_subsequence type State100024720.
- Longest_increasing_subsequence comment "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.".
- Longest_increasing_subsequence label "Longest increasing subsequence".
- Longest_increasing_subsequence label "Задача поиска наибольшей увеличивающейся подпоследовательности".
- Longest_increasing_subsequence sameAs m.025t4yf.
- Longest_increasing_subsequence sameAs Q4183855.
- Longest_increasing_subsequence sameAs Q4183855.
- Longest_increasing_subsequence sameAs Longest_increasing_subsequence.
- Longest_increasing_subsequence wasDerivedFrom Longest_increasing_subsequence?oldid=603153811.
- Longest_increasing_subsequence isPrimaryTopicOf Longest_increasing_subsequence.