First Page | Document Content | |
---|---|---|
Date: 2013-02-14 13:17:57Probabilistic complexity theory Structural complexity theory NP-complete problems Approximation algorithms 2-satisfiability L-reduction Reduction PCP theorem Probabilistically checkable proof Theoretical computer science Applied mathematics Computational complexity theory | Approximation Algorithms (ADM III)Add to Reading ListSource URL: www.coga.tu-berlin.deDownload Document from Source WebsiteFile Size: 98,82 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 |