Monthly Archives: October 2010

Well, just do the impossible!

One of the slightly bizarre aspects of computer science is that we do the “impossible” all the time. One way this happens is that, while SAT is famously NP-complete, and we often regard NP-complete problems to be “intractable,” it turns … Continue reading

Posted in Compilers | Leave a comment