See Quine-McCluskey algorithm on Wiktionary
Download JSON data for Quine-McCluskey algorithm meaning in All languages combined (1.4kB)
{
"etymology_text": "It was developed by Willard V. Quine and extended by Edward J. McCluskey.",
"head_templates": [
{
"args": {},
"expansion": "Quine-McCluskey algorithm",
"name": "en-proper noun"
}
],
"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"
}
],
"glosses": [
"A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants."
],
"id": "en-Quine-McCluskey_algorithm-en-name-I9KodUfg",
"links": [
[
"minimization",
"minimization"
],
[
"Boolean",
"Boolean"
],
[
"function",
"function"
],
[
"Karnaugh map",
"Karnaugh map"
],
[
"tabular",
"tabular"
],
[
"efficient",
"efficient"
],
[
"computer",
"computer"
],
[
"algorithm",
"algorithm"
],
[
"prime",
"prime"
],
[
"implicant",
"implicant"
]
],
"wikipedia": [
"Quine-McCluskey algorithm"
]
}
],
"word": "Quine-McCluskey algorithm"
}
{
"etymology_text": "It was developed by Willard V. Quine and extended by Edward J. McCluskey.",
"head_templates": [
{
"args": {},
"expansion": "Quine-McCluskey algorithm",
"name": "en-proper noun"
}
],
"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"
],
"glosses": [
"A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants."
],
"links": [
[
"minimization",
"minimization"
],
[
"Boolean",
"Boolean"
],
[
"function",
"function"
],
[
"Karnaugh map",
"Karnaugh map"
],
[
"tabular",
"tabular"
],
[
"efficient",
"efficient"
],
[
"computer",
"computer"
],
[
"algorithm",
"algorithm"
],
[
"prime",
"prime"
],
[
"implicant",
"implicant"
]
],
"wikipedia": [
"Quine-McCluskey algorithm"
]
}
],
"word": "Quine-McCluskey algorithm"
}
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-05-16 from the enwiktionary dump dated 2024-05-02 using wiktextract (e268c0e and 304864d). 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.