Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
137things
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
137things
8y ago
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