C: KN-WORK WORK DiMoFa05 conferences IASTED-PDCS CR difatta.dvi - Subgraph isomorphism problem - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2010-11-08 10:09:34 Parallel computing Cheminformatics Computational chemistry NP-complete problems Data mining Graph theory Subgraph isomorphism problem Parallel algorithm Association rule learning Theoretical computer science Computing Applied mathematics		C:/KN-WORK/WORK/DiMoFa05/conferences/IASTED-PDCS/CR/difatta.dvi Add to Reading List Source URL: www.inf.uni-konstanz.de Download Document from Source Website File Size: 121,83 KB Share 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 paradigma DocID: 1udfk - View Document
	Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006 DocID: 1tIrp - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document
	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document