First Page | Document Content | |
---|---|---|
Date: 2017-10-25 03:25:49 | 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 paradigmaAdd to Reading ListSource URL: www2.ims.nus.edu.sgDownload Document from Source WebsiteFile Size: 1,11 MBShare Document on Facebook |