See NP-hard on Wiktionary
Download JSON data for NP-hard meaning in All languages combined (2.7kB)
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "NP-hard (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "50 50",
"word": "NP-complete"
},
{
"_dis1": "50 50",
"word": "NP-easy"
},
{
"_dis1": "50 50",
"word": "NP-equivalent"
}
],
"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": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H."
],
"id": "en-NP-hard-en-adj--TNeXZCN",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"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": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction."
],
"id": "en-NP-hard-en-adj-ZT9Ay7LV",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"translations": [
{
"_dis1": "0 0",
"code": "fi",
"lang": "Finnish",
"sense": "hard",
"word": "NP-kova"
},
{
"_dis1": "0 0",
"code": "fi",
"lang": "Finnish",
"sense": "hard",
"word": "NP-vaikea"
},
{
"_dis1": "0 0",
"code": "fr",
"lang": "French",
"sense": "hard",
"word": "NP-dur"
},
{
"_dis1": "0 0",
"code": "he",
"lang": "Hebrew",
"sense": "hard",
"word": "NP-קשה"
}
],
"wikipedia": [
"NP-hard"
],
"word": "NP-hard"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English uncomparable adjectives"
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "NP-hard (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "NP-complete"
},
{
"word": "NP-easy"
},
{
"word": "NP-equivalent"
}
],
"senses": [
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "hard",
"word": "NP-kova"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "hard",
"word": "NP-vaikea"
},
{
"code": "fr",
"lang": "French",
"sense": "hard",
"word": "NP-dur"
},
{
"code": "he",
"lang": "Hebrew",
"sense": "hard",
"word": "NP-קשה"
}
],
"wikipedia": [
"NP-hard"
],
"word": "NP-hard"
}
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-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). 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.