See nonuniform polynomial time on Wiktionary
{
"forms": [
{
"form": "nonuniform polynomial times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "nonuniform polynomial time (countable and uncountable, plural nonuniform 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": [
"The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
],
"id": "en-nonuniform_polynomial_time-en-noun-ItNXuc6a",
"links": [
[
"computer science",
"computer science"
],
[
"computational complexity theory",
"computational complexity theory"
],
[
"decision problem",
"decision problem"
],
[
"solvable",
"solvable"
],
[
"family",
"family"
],
[
"polynomial",
"polynomial"
],
[
"size",
"size"
],
[
"Boolean circuit",
"Boolean circuit"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "nonuniform polynomial time"
}
{
"forms": [
{
"form": "nonuniform polynomial times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "nonuniform polynomial time (countable and uncountable, plural nonuniform 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": [
"The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
],
"links": [
[
"computer science",
"computer science"
],
[
"computational complexity theory",
"computational complexity theory"
],
[
"decision problem",
"decision problem"
],
[
"solvable",
"solvable"
],
[
"family",
"family"
],
[
"polynomial",
"polynomial"
],
[
"size",
"size"
],
[
"Boolean circuit",
"Boolean circuit"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "nonuniform polynomial time"
}
Download raw JSONL data for nonuniform polynomial time meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). 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.