{
  "id": "enwiki-001372297226",
  "slug": "nlin",
  "title": "NLIN",
  "qid": "",
  "lead": "In computational complexity theory, NLIN is the class of decision problems that can be solved by a nondeterministic multitape Turing machine in linear time. It is known that this class differs from its deterministic counterpart, DLIN.",
  "body": "In computational complexity theory, NLIN is the class of decision problems that can be solved by a nondeterministic multitape Turing machine in linear time. It is known that this class differs from its deterministic counterpart, DLIN. ==References==",
  "categories": [
    "23057298",
    "23468805",
    "28699527",
    "29176649"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1372297226",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1788143280.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001372297226",
    "type": "webpage",
    "title": "NLIN",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/nlin",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001372297226",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1372297226",
    "note": "Immutable snapshot enwiki-001372297226"
  }
}