{
  "aliases": [
    "longest-increasing-subsequence-problem",
    "longest-nondecreasing-subsequence",
    "nondecreasing-subsequence"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn computer science, the **longest increasing subsequence** problem aims to find a [[subsequence|0F1PR74BRX]] of a given [[sequence|0G9EKM0E15]] 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 increasing subsequence problem is solvable in time $O(n \\log n),$ where $n$ denotes the length of the input sequence.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "longest-increasing-subsequence-problem",
      "longest-nondecreasing-subsequence",
      "nondecreasing-subsequence"
    ],
    "inventory": [
      "PP295R2ZTP"
    ],
    "kind": "concept",
    "name": "Longest increasing subsequence",
    "same_as": {
      "wikidata": "Q4183855",
      "wikipedia": "Longest increasing subsequence"
    },
    "sources": [
      {
        "locator": "Longest increasing subsequence",
        "mention": "wikipedia://en/4587078",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:4587078@r1355103452"
      }
    ],
    "tag": "A7XZYGW44S"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/A7XZYGW44S/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/A7XZYGW44S.md",
  "msc": null,
  "name": "Longest increasing subsequence",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/A7X/A7XZYGW44S.md",
  "status": null,
  "tag": "A7XZYGW44S",
  "uri": "m2://A7XZYGW44S",
  "url": "https://math2.tamnd.com/wiki/longest-increasing-subsequence/",
  "writing": {
    "tag": "A7XZYGW44S",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}