NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
491	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
492	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics
493	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane Stephane Durocher∗ Chris Gray† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:44 Applied mathematics Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Permutation Theoretical computer science Mathematics NP-complete problems
494	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
495	An NP-complete Problem for the Abelian Sandpile Model Matthias Schulz Department for Computer Sciences, University of Karlsruhe, Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:37:04 Fuzes Systems theory Bak–Tang–Wiesenfeld sandpile Abelian sandpile model CW complex Grains of Sand Self-organization Topology Mathematics
496	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
497	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
498	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
499	PDF Document Add to Reading List Source URL: www.psi.toronto.edu Language: English - Date: 2014-04-30 16:04:07 NP-complete problems Probability theory Operations research Belief propagation Coding theory Fourier transform Combinatory logic Dominating set Linear programming Theoretical computer science Mathematics Applied mathematics
500	Proceedings of the 2005 International Conference on Simulation and Modeling V. Kachitvichyanukul, U. Purintrapiban, P. Utayopas, eds. HETEROGENOUS ANT ALGORITHM FOR JOB SHOP SCHEDULING Apinanthana Udomsakdigool and Vorat Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 21:51:44 Theoretical computer science Mathematical optimization NP-complete problems Ant colony optimization algorithms Stochastic optimization Collective intelligence Travelling salesman problem Job shop scheduling Artificial Ants Applied mathematics Operations research Mathematics

UPDATE