"nondeterministic polynomial time" meaning in All languages combined

{
  "forms": [
    {
      "form": "nondeterministic polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~",
        "head": "nondeterministic polynomial time"
      },
      "expansion": "nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)",
      "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": [
        "A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine."
      ],
      "id": "en-nondeterministic_polynomial_time-en-noun-TlSw58Ex",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "class",
          "class"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "solution",
          "solution"
        ],
        [
          "verified",
          "verified"
        ],
        [
          "deterministic Turing machine",
          "deterministic Turing machine"
        ],
        [
          "polynomial time",
          "polynomial time"
        ],
        [
          "problem",
          "problem"
        ],
        [
          "solved",
          "solved"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ]
      ],
      "raw_glosses": [
        "(computer science) A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine."
      ],
      "synonyms": [
        {
          "word": "NP time"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nondeterministic polynomial time"
}

{
  "forms": [
    {
      "form": "nondeterministic polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~",
        "head": "nondeterministic polynomial time"
      },
      "expansion": "nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "class",
          "class"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "solution",
          "solution"
        ],
        [
          "verified",
          "verified"
        ],
        [
          "deterministic Turing machine",
          "deterministic Turing machine"
        ],
        [
          "polynomial time",
          "polynomial time"
        ],
        [
          "problem",
          "problem"
        ],
        [
          "solved",
          "solved"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ]
      ],
      "raw_glosses": [
        "(computer science) A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine."
      ],
      "synonyms": [
        {
          "word": "NP time"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nondeterministic polynomial time"
}