strong NP-completeness
property of computational problems that is a special case of NP-completeness
| rdfs:label |
"strong NP-completeness"@en
|
|
skos:alt |
"fuerte NP-completitud"@es
|
| schema:description |
"property of computational problems that is a special case of NP-completeness"@en
|
|
schema:date |
"2023-12-03T19:15:32+00:00"^^xsd:dateTime |
| schema:version | 2023236245 |
| wikibase:identifiers | 2 |
| wikibase:sitelinks | 5 |
| wikibase:statements | 5 |
| p:P31 | wd:statement/Q7624684-7F89FC75-4A5F-4511-944B-5351827C8F76 |
| p:P361 | wd:statement/Q7624684-028d36f3-421b-7062-0a8b-c1aa47400574 |
| p:P6366 | wd:statement/Q7624684-01D34B3B-74E8-43D4-898C-09576833E645 |
| p:P646 | wd:statement/Q7624684-460E3F71-4717-4E8D-A465-B953D64966A5 |
| p:P910 | wd:statement/Q7624684-56460854-4c09-4491-8828-a8628da72f96 |
|
p:direct- |
<https:/ |
| wdt:P31 | complexity class |
| wdt:P361 | NP-complete |
| wdt:P6366 | "94735162" |
| wdt:P646 | "/m/0g0vrx" |
| wdt:P910 | Category:Strongly NP-complete problems |
Download as: