| Display title | Weak NP-completeness |
| Default sort key | Weak NP-completeness |
| Page length (in bytes) | 2,124 |
| Namespace ID | 0 |
| Page ID | 8047019 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Wikidata item ID | Q7977975 |
| Central 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 |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Zarrabi (talk | contribs) |
| Date of page creation | 08:33, 21 November 2006 |
| Latest editor | Malcolmxl5 (talk | contribs) |
| Date of latest edit | 23:56, 28 May 2022 |
| Total number of edits | 33 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded templates (14) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
