"NTIME" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "NTIME",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided)."
      ],
      "id": "en-NTIME-en-noun-NWeB6CzV",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "complexity class",
          "complexity class"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ],
        [
          "big O notation",
          "big O notation"
        ]
      ],
      "raw_glosses": [
        "(computer science) In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided)."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "NTIME"
}

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "NTIME",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided)."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "complexity class",
          "complexity class"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ],
        [
          "big O notation",
          "big O notation"
        ]
      ],
      "raw_glosses": [
        "(computer science) In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided)."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "NTIME"
}