First Page | Document Content | |
---|---|---|
Date: 2014-08-13 19:26:58NP-complete problems Constraint programming Logic in computer science Propositional calculus Unsatisfiable core Electronic design automation Boolean satisfiability problem Symmetry Satisfiability Theoretical computer science Mathematics Applied mathematics | A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina TorlakAdd to Reading ListSource URL: homes.cs.washington.eduDownload Document from Source WebsiteFile Size: 1,38 MBShare Document on Facebook |
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 paradigmaDocID: 1udfk - View Document | |
Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006DocID: 1tIrp - View Document | |
Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights ReservedDocID: 1rtvU - View Document | |
On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID LisbonDocID: 1rsZm - View Document | |
Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo CanadaDocID: 1rsEH - View Document |