Back to Results
First PageMeta Content



Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma
Add to Reading List

Document Date: 2017-10-25 03:25:49


Open Document

File Size: 1,11 MB

Share Result on Facebook
UPDATE