Information for "Proof that Boolean satisfiability problem is NP-complete"
Jump to navigation
Jump to search
Basic information
| Display title | Proof that Boolean satisfiability problem is NP-complete |
| Redirects to | Cook–Levin theorem (info) |
| Default sort key | Proof that Boolean satisfiability problem is NP-complete |
| Page length (in bytes) | 40 |
| Namespace ID | 0 |
| Page ID | 2283717 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | imported>Gdr |
| Date of page creation | 15:01, 19 January 2008 |
| Latest editor | imported>Gdr |
| Date of latest edit | 15:01, 19 January 2008 |
| Total number of edits | 1 |
| Total number of distinct authors | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |