First Page | Document Content | |
---|---|---|
Date: 2010-09-11 18:41:20Computer programming Theoretical computer science Software engineering Logic in computer science Computational complexity theory Boolean algebra NP-complete problems Formal methods Boolean satisfiability problem Conditional Reduction Algorithm | The Straight-Line Automatic Programming Problem Rajeev Joshi, Greg Nelson, Yunhong Zhou HP Laboratories Palo Alto HPLNovember 20th , 2003* superoptimization,Add to Reading ListSource URL: rjoshi.orgDownload Document from Source WebsiteFile Size: 94,91 KBShare 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 |