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

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 paradigma Add to Reading List Source URL: www2.ims.nus.edu.sg Download Document from Source Website File Size: 1,11 MB Share Document on Facebook