| Display title | Circuit satisfiability problem |
| Default sort key | Circuit satisfiability problem |
| Page length (in bytes) | 9,144 |
| Namespace ID | 0 |
| Page ID | 34599223 |
| 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 | 6 |
| Counted as a content page | Yes |
| Wikidata item ID | Q5121622 |
| Local description | Classic NP-complete problem in computer science |
| Central description | classic NP-complete problem in computer science |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | The Anome (talk | contribs) |
| Date of page creation | 10:31, 4 February 2012 |
| Latest editor | Nyq (talk | contribs) |
| Date of latest edit | 17:15, 11 June 2025 |
| Total number of edits | 84 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (36) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
