See nondeterministic polynomial time in All languages combined, or Wiktionary
Download JSON data for nondeterministic polynomial time meaning in English (1.9kB)
{
"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": "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."
],
"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",
"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."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "nondeterministic polynomial time"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.