Ratings2
Average rating3.5
Reviews with the most likes.
Does P=NP? P are all problems that are easily solvable, NP are hard problems that are hard to solve but easy to verify. This slim volume explains the topic without the use of any mathematics. Interesting but the writing is only so-so.