NP-Complete Problems are all Equally Hard/Historical Note
Jump to navigation
Jump to search
Historical Note on NP-Complete Problems are all Equally Hard
The theorem NP-Complete Problems are all Equally Hard was demonstrated by Stephen Arthur Cook in $1971$.
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): NP problem
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): NP problem