See randomized polynomial time on Wiktionary
{
"forms": [
{
"form": "randomized polynomial times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~",
"head": "randomized polynomial time"
},
"expansion": "randomized polynomial time (countable and uncountable, plural randomized 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"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"The complexity class of problems for which a probabilistic Turing machine exists with certain properties."
],
"id": "en-randomized_polynomial_time-en-noun-GmizYxOF",
"links": [
[
"mathematics",
"mathematics"
],
[
"computer science",
"computer science"
],
[
"complexity class",
"complexity class"
],
[
"problem",
"problem"
],
[
"probabilistic",
"probabilistic"
],
[
"Turing machine",
"Turing machine"
],
[
"exist",
"exist"
],
[
"properties",
"property"
]
],
"raw_glosses": [
"(mathematics, computer science) The complexity class of problems for which a probabilistic Turing machine exists with certain properties."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "randomized polynomial time"
}
{
"forms": [
{
"form": "randomized polynomial times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~",
"head": "randomized polynomial time"
},
"expansion": "randomized polynomial time (countable and uncountable, plural randomized 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",
"en:Mathematics"
],
"glosses": [
"The complexity class of problems for which a probabilistic Turing machine exists with certain properties."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"computer science",
"computer science"
],
[
"complexity class",
"complexity class"
],
[
"problem",
"problem"
],
[
"probabilistic",
"probabilistic"
],
[
"Turing machine",
"Turing machine"
],
[
"exist",
"exist"
],
[
"properties",
"property"
]
],
"raw_glosses": [
"(mathematics, computer science) The complexity class of problems for which a probabilistic Turing machine exists with certain properties."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "randomized polynomial time"
}
Download raw JSONL data for randomized polynomial time meaning in All languages combined (1.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). 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.