NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
351	PDF Document Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-10-23 04:38:55 Graph theory Directed graph Flow network Edsger W. Dijkstra Network theory NP-complete problems
352	AND-compression of NP-complete problems: Streamlined proof and minor observations Holger Dell Saarland University Cluster of Excellence, MMCI ∗ September 23, 2014 Add to Reading List Source URL: www.holgerdell.com Language: English
353	Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied Add to Reading List Source URL: www.piercelab.caltech.edu Language: English - Date: 2010-09-08 02:56:32 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-hard NP-complete Dead-end elimination NP P Theoretical computer science Computational complexity theory Applied mathematics
354	The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio Add to Reading List Source URL: research.yahoo.com Language: English - Date: 2013-04-05 04:39:54 NP-complete problems Graph operations Graph coloring Dense subgraph Graph partition Community structure Tree Shortest path problem Graph Graph theory Theoretical computer science Mathematics
355	Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions Add to Reading List Source URL: cognitiveharmony.net Language: English - Date: 2008-09-30 17:00:23 Complexity classes NP-hard NP-complete NP P versus NP problem P Reduction Decision problem Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
356	Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems
357	Syntax-Guided Synthesis Rajeev ALUR a , Rastislav BODIK b , Eric DALLAL c , Dana FISMAN a , Pranav GARG d , Garvit JUNIWAL b , Hadas KRESS-GAZIT e , P. MADHUSUDAN d , Milo M. K. MARTIN a , Mukund RAGHOTHAMAN a , Shamwadi Add to Reading List Source URL: sygus.seas.upenn.edu Language: English - Date: 2015-01-10 00:32:21 Predicate logic Theoretical computer science Formal methods NP-complete problems First-order logic Satisfiability Modulo Theories Expression Type system Function Mathematics Logic Mathematical logic
358	c 2005 Society for Industrial and Applied Mathematics SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351 Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2009-09-24 16:08:59 Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
359	GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida Add to Reading List Source URL: crcv.ucf.edu Language: English - Date: 2015-04-13 12:15:56 Clique problem Clique Graph operations Networks Tree decomposition Decomposition method Graph theory Theoretical computer science NP-complete problems
360	A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4\|E(G)\| − \|V (G Add to Reading List Source URL: www.pkoms.com Language: English - Date: 2011-12-29 23:15:14 Matroid theory Polynomials Tutte polynomial Degree Tree NP-complete problems Path decomposition Handshaking lemma Graph theory Mathematics Theoretical computer science

UPDATE