See P-complete in All languages combined, or Wiktionary
Download JSON data for P-complete meaning in English (2.4kB)
{
"head_templates": [
{
"args": {
"1": "-",
"head": "P-complete"
},
"expansion": "P-complete (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "63 37",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P."
],
"id": "en-P-complete-en-adj-16CgL3DL",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"P",
"P"
],
[
"polynomial time",
"polynomial time"
]
],
"raw_glosses": [
"(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "describing any problem in P to which there exists a polynomial time mapping from any other problem in P",
"word": "P-täydellinen"
},
{
"code": "de",
"lang": "German",
"sense": "describing any problem in P to which there exists a polynomial time mapping from any other problem in P",
"word": "P-vollständig"
}
]
}
],
"word": "P-complete"
}
{
"head_templates": [
{
"args": {
"head": "P-complete"
},
"expansion": "P-complete",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"The set of such problems."
],
"id": "en-P-complete-en-name-Cx~aXZPf",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"set",
"set"
]
],
"raw_glosses": [
"(computing theory) The set of such problems."
],
"related": [
{
"word": "NP-complete"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "P-complete"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncomparable adjectives",
"English uncountable nouns"
],
"head_templates": [
{
"args": {
"1": "-",
"head": "P-complete"
},
"expansion": "P-complete (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"P",
"P"
],
[
"polynomial time",
"polynomial time"
]
],
"raw_glosses": [
"(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "describing any problem in P to which there exists a polynomial time mapping from any other problem in P",
"word": "P-täydellinen"
},
{
"code": "de",
"lang": "German",
"sense": "describing any problem in P to which there exists a polynomial time mapping from any other problem in P",
"word": "P-vollständig"
}
],
"word": "P-complete"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncomparable adjectives",
"English uncountable nouns"
],
"head_templates": [
{
"args": {
"head": "P-complete"
},
"expansion": "P-complete",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "NP-complete"
}
],
"senses": [
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"The set of such problems."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"set",
"set"
]
],
"raw_glosses": [
"(computing theory) The set of such problems."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "P-complete"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-04-26 from the enwiktionary dump dated 2024-04-21 using wiktextract (93a6c53 and 21a9316). 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.