Hacker News
Lobsters
- NP-Complete isn't (always) Hard https://www.hillelwayne.com/post/np-hard/ 18 comments compsci , programming
Linking pages
Linked pages
- Modern SAT solvers: fast, neat and underused (part 1 of N) — The Coding Nest https://codingnest.com/modern-sat-solvers-fast-neat-underused-part-1-of-n/ 466 comments
- P versus NP problem - Wikipedia https://en.wikipedia.org/wiki/P_versus_NP_problem#P_=_NP 109 comments
- algorithm - What is a plain English explanation of "Big O" notation? - Stack Overflow http://stackoverflow.com/a/487278 43 comments
- How to Solve the Sudoku Puzzle with programming • Hillel Wayne https://www.hillelwayne.com/post/sudoku/ 17 comments
- Complexity Zoo https://complexityzoo.net/Complexity_Zoo 7 comments
- https://www.cs.rice.edu/~vardi/papers/SATSolvers21.pdf 6 comments
- https://sat-smt.codes/SAT_SMT_by_example.pdf 2 comments
- Emina Torlak: A Primer on Boolean Satisfiability https://homes.cs.washington.edu/~emina/blog/2017-06-23-a-primer-on-sat.html 0 comments
- NP-completeness - Wikipedia https://en.wikipedia.org/wiki/NP-completeness 0 comments
- pub/solver.md at master · dart-lang/pub · GitHub https://github.com/dart-lang/pub/blob/master/doc/solver.md 0 comments
- Shtetl-Optimized » Blog Archive » The Scientific Case for P≠NP https://scottaaronson.blog/?p=1720 0 comments
Would you like to stay up to date with Computer science? Checkout Computer science
Weekly.
Related searches:
Search whole site: site:hillelwayne.com
Search title: NP-Complete isn't (always) Hard • Hillel Wayne
See how to search.