<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-07-21 06:41:07Theoretical computer science Mathematics Computational complexity theory Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Automated reasoning |
Add to Reading List |
Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014 | 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 |