Hacker News
- Why cryptography is not based on NP-complete problems https://blintzbase.com/posts/cryptography-is-not-based-on-np-hard-problems/ 55 comments
Linked pages
- Knapsack problem - Wikipedia http://en.wikipedia.org/wiki/Knapsack_problem 348 comments
- Four color theorem - Wikipedia http://en.wikipedia.org/wiki/Four_color_theorem 44 comments
- Graph coloring - Wikipedia https://en.wikipedia.org/wiki/Graph_coloring 17 comments
- Subset sum problem - Wikipedia https://en.wikipedia.org/wiki/Subset_sum_problem 14 comments
- Time complexity - Wikipedia https://en.wikipedia.org/wiki/Time_complexity 3 comments
- NP-completeness - Wikipedia https://en.wikipedia.org/wiki/NP-completeness 0 comments
- Trapdoor function - Wikipedia https://en.wikipedia.org/wiki/Trapdoor_function 0 comments
Related searches:
Search whole site: site:blintzbase.com
Search title: Why cryptography is not based on NP-complete problems
See how to search.