First Page | Document Content | |
---|---|---|
Date: 2014-02-17 02:59:42Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory | Scheduling and SAT Emmanuel Hebrard Toulouse OutlineAdd to Reading ListSource URL: homepages.laas.frDownload Document from Source WebsiteFile Size: 520,25 KBShare Document on Facebook |