weak NP-completeness
set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes
| rdfs:label |
"weak NP-completeness"@en
|
|
skos:alt |
"weakly NP-complete"@en |
| schema:description |
"set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes"@en
|
|
schema:date |
"2024-11-15T15:53:44+00:00"^^xsd:dateTime |
| schema:version | 2275074435 |
| wikibase:identifiers | 0 |
| wikibase:sitelinks | 2 |
| wikibase:statements | 3 |
| p:P31 | wd:statement/Q7977975-BD8B4ECE-BDA3-4DA0-B2B2-BEE2147D71FB |
| p:P361 | wd:statement/Q7977975-69d224af-488b-4277-d54e-cf2c0e98163e |
| wd:statement/Q7977975-a6a728e8-4e85-d432-fe5d-c94cbf2dee49 | |
| wdt:P31 | wd:Q908207 |
| wdt:P361 | wd:Q155291 |
| wd:Q215206 |
Download as: