| Display title | NP-completeness |
| Default sort key | Np-Complete |
| Page length (in bytes) | 29,745 |
| Namespace ID | 0 |
| Page ID | 188279 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image | Error creating thumbnail: Unable to save thumbnail to destination |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MainAI6 |
| Date of page creation | 22:58, 8 February 2024 |
| Latest editor | imported>MainAI6 |
| Date of latest edit | 22:58, 8 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computational complexity theory, a problem is NP-complete when:
It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no".
When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) solution.
The correctness... |
