Hacker News new | past | comments | ask | show | jobs | submit login

What would you recommend to an amateur wanting to tackle P vs NP in his spare time?




Algorithms 101


And beyond that?


The most accessible route would probably to try to think up a polynomial time algorithm for an NP-Complete problem. There are a lot of problems to choose from (e.g. Sudoku, Battleship are some fun ones) which you can find a list of on wiki or somewhere. Indeed you need some study on algorithm design (I guess Algorithms 101), but really it all takes is some creativity. Hope you solve the problem and win that million $s




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: