Information for "P=NP implies a deterministic algorithm to find primes"
From Polymath Wiki
Jump to navigationJump to search
Basic information
| Display title | P=NP implies a deterministic algorithm to find primes |
| Default sort key | P=NP implies a deterministic algorithm to find primes |
| Page length (in bytes) | 819 |
| Namespace ID | 0 |
| Page ID | 225 |
| 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 | WikiSysop (talk | contribs) |
| Date of page creation | 13:25, 28 July 2009 |
| Latest editor | Gowers (talk | contribs) |
| Date of latest edit | 13:35, 28 July 2009 |
| Total number of edits | 3 |
| Total number of distinct authors | 2 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
