Theory & algorithms1982
When checking is easier than finding
NP-completeness connected apparently different difficult problems.
The storyACM A. M. Turing Award
When checking is easier than finding
NP-completeness connected apparently different difficult problems.
The story