Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Interestingly, Knuth swapped dancing links for dancing cells and implemented a bunch of SAT solvers (and counting solutions to polyomino tiling problems) using zero suppressed binary decision diagrams. So algorithms X has newer and more efficient successors.


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

Search: