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

"All" isn't right.

You can only encode decision problems in NP into a SAT instance of polynomially-balanced size. Sure, that's a lot of things, but there are things provably not in this set.



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

Search: