See Cook-Levin theorem on Wiktionary
{
"etymology_text": "Named after Stephen Cook and Leonid Levin.",
"forms": [
{
"form": "the Cook-Levin theorem",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Cook-Levin theorem",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"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": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A theorem stating that the Boolean satisfiability problem is NP-complete."
],
"id": "en-Cook-Levin_theorem-en-name-MHRJzHET",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete."
],
"synonyms": [
{
"word": "Cook's theorem"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Cook-Levin theorem"
}
{
"etymology_text": "Named after Stephen Cook and Leonid Levin.",
"forms": [
{
"form": "the Cook-Levin theorem",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Cook-Levin theorem",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A theorem stating that the Boolean satisfiability problem is NP-complete."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete."
],
"synonyms": [
{
"word": "Cook's theorem"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Cook-Levin theorem"
}
Download raw JSONL data for Cook-Levin theorem meaning in All languages combined (1.2kB)
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-02-26 from the enwiktionary dump dated 2025-02-21 using wiktextract (ce0be54 and f2e72e5). 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.