NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
471	Exploiting symmetries in logistics distribution planning Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 22:34:44 NP-complete problems Analysis of algorithms Algorithm Mathematical logic Travelling salesman problem Logistics Symmetry in mathematics Time complexity Vehicle routing problem Theoretical computer science Computational complexity theory Applied mathematics
472	CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines Gruia C˘alinescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes NP-complete problems Combinatorial optimization Operations research Computational problems Linear programming relaxation APX NP-complete Boolean satisfiability problem Theoretical computer science Computational complexity theory Mathematics
473	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
474	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
475	Solving Single-digit Sudoku Subproblems David Eppstein Int. Conf. Fun with Algorithms, June 2012 Sudoku Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2013-04-23 16:29:40 Recreational mathematics Sudoku Backtracking Sudoku algorithms Puzzle Mathematics of Sudoku Logic puzzles Mathematics NP-complete problems
476	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
477	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Open Problems from CCCG 2005 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:54 Discrete geometry Euclidean plane geometry Computational geometry NP-complete problems K-set 3SUM Pseudotriangle Planar graph Dominating set Graph theory Mathematics Geometry
478	On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:45:37 Graph coloring NP-complete problems Edge coloring Independent set Matching Maximal independent set Interval graph Bipartite graph Domatic number Graph theory Mathematics Theoretical computer science
479	Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:49:42 NP-complete problems Parameterized complexity Exponential time hypothesis Dominating set Tree decomposition Vertex cover Graph coloring Equitable coloring Clique Theoretical computer science Graph theory Mathematics
480	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.inf.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes

UPDATE