Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4183855> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Q4183855 subject Q7020692.
- Q4183855 subject Q7142640.
- Q4183855 subject Q7216313.
- Q4183855 subject Q8794758.
- Q4183855 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.".
- Q4183855 wikiPageExternalLink 22945390.
- Q4183855 wikiPageExternalLink Longest_Increasing_Subsequence.
- Q4183855 wikiPageExternalLink 9591.
- Q4183855 wikiPageWikiLink Q1134404.
- Q4183855 wikiPageWikiLink Q1196873.
- Q4183855 wikiPageWikiLink Q13220368.
- Q4183855 wikiPageWikiLink Q133250.
- Q4183855 wikiPageWikiLink Q133871.
- Q4183855 wikiPageWikiLink Q13636890.
- Q4183855 wikiPageWikiLink Q141001.
- Q4183855 wikiPageWikiLink Q161519.
- Q4183855 wikiPageWikiLink Q17079793.
- Q4183855 wikiPageWikiLink Q17457.
- Q4183855 wikiPageWikiLink Q176604.
- Q4183855 wikiPageWikiLink Q190391.
- Q4183855 wikiPageWikiLink Q21198.
- Q4183855 wikiPageWikiLink Q2166280.
- Q4183855 wikiPageWikiLink Q2303697.
- Q4183855 wikiPageWikiLink Q243754.
- Q4183855 wikiPageWikiLink Q269878.
- Q4183855 wikiPageWikiLink Q2997917.
- Q4183855 wikiPageWikiLink Q3321291.
- Q4183855 wikiPageWikiLink Q3375503.
- Q4183855 wikiPageWikiLink Q3480255.
- Q4183855 wikiPageWikiLink Q380679.
- Q4183855 wikiPageWikiLink Q395.
- Q4183855 wikiPageWikiLink Q413.
- Q4183855 wikiPageWikiLink Q4355278.
- Q4183855 wikiPageWikiLink Q451652.
- Q4183855 wikiPageWikiLink Q650859.
- Q4183855 wikiPageWikiLink Q7020692.
- Q4183855 wikiPageWikiLink Q7142640.
- Q4183855 wikiPageWikiLink Q7169369.
- Q4183855 wikiPageWikiLink Q7216313.
- Q4183855 wikiPageWikiLink Q761631.
- Q4183855 wikiPageWikiLink Q7831889.
- Q4183855 wikiPageWikiLink Q786431.
- Q4183855 wikiPageWikiLink Q8794758.
- Q4183855 wikiPageWikiLink Q976607.
- Q4183855 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.".
- Q4183855 label "Longest increasing subsequence".