What is Reddit's opinion of The Golden Ticket: P, NP, and the Search for the Impossible?

From 3.5 billion Reddit comments

We used this textbook in my Computational Complexity course:

https://greenteapress.com/wp/think-complexity-2e/

Super interesting. Lots of projects you can do in it.

This is a super easy to read book about complexity:

https://www.amazon.com/Golden-Ticket-NP-Search-Impossible/dp/0691156492

This class was worthless when I took it in 2014, it is amazing they have not improved it. I raised hell all the way to the top of the OSU Engineering School, the best they did was add a bunch of extra credit to the final.

Remember one thing about this class, you are suppose to come away with the ability to design efficient algorithms and analyze their complexity. This class is suppose to give you all the tools and techniques to accomplish this, but it doesn't.

This is the most important class you will take in order to get a job at a top tech company. It was the entire reason I pursued a second degree. I learned a 10th of what I should have, I am still pissed.

Advice: learn all the material elsewhere. The lectures and book are worthless. Check out this post for a list of resources:

https://www.reddit.com/r/OSUOnlineCS/comments/agomik/cs_325_resources/

Go to Hacker Rank and leetcode to practice designing algorithms.

​

Learning Path:

1. You have to learn big oh, this is how you can quickly analyze the complexity of an algorithm. In the real world, you just need to quickly identify if you can improve the runtime of your code, or if you coded an algorithm that would take forever to run. Although you have to learn the math part for this class, start with just learning how to read code and identify big oh, Cracking The Coding Interview has the best chapter to teach you this
2. The tools to design an efficient algorithm: recursion, greedy, dynamic, linear programming, etc.. Hacker Rank and the Grokking Algorithms book can teach you this
3. How to actually design an algorithm: this class will not teach how to actually do this and the fucked up part is this is the main skill you need to get a job with a top tech company. Hacker Rank and Leetcode will teach you this.
4. For the np-complete section, read this entire book. It saved my 4.0: https://www.amazon.com/Golden-Ticket-NP-Search-Impossible/dp/0691156492/ref=sr_1_2?keywords=p+np&qid=1547909665&sr=8-2-spell

​

A proof that P=NP would break the world, not literally but damn close (as an example all our encryption would be utterly useless - how long will it take for someone to screw with all the banks in the world? days? months? I will assume faster than anyone can find a new encryption theory that works in a P=NP world).
In general it would imply that it is just as easy to validate a solution to a problem as it is to solve the problem itself; quite counter intuitive! This is quite an over-simplification of what it would really would mean, but I'm certainly not the best one to explain the full effect of P=NP. Some other people have written books about this, you should go read them if you want to know more. I think this one is one of the newest. It non technical, but have received quite some good reviews.