First Page | Document Content | |
---|---|---|
![]() Date: 2004-10-18 03:25:13NP-complete problems Analysis of algorithms Parameterized complexity Planar graphs Graph operations Bidimensionality Apex graph Tree decomposition Dominating set Graph theory Theoretical computer science Mathematics | Source URL: erikdemaine.orgDownload Document from Source WebsiteFile Size: 256,55 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 |