NP-complete

Results: 1728



#Item
131Computational complexity theory / Complexity classes / Theory of computation / PPAD / Reduction / LemkeHowson algorithm / Algorithm / NP / PSPACE-complete / P / True quantified Boolean formula

The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2013-10-30 13:41:09
132Crosswords / Cryptic crossword / Anagram / Mind / Gaming / Logic puzzles / NP-complete problems / Puzzles

Puzzle "Hall of Fame" by John de Cuevas Instructions: The cryptic clues define fourteen radial words, sections A to G, and twenty row words, 1 to 7, to be entered in the grid in the order of their clues. All spaces, incl

Add to Reading List

Source URL: www.puzzlecrypt.com

Language: English - Date: 2013-05-26 17:52:09
133Mathematics / Computational complexity theory / Applied mathematics / NP-complete problems / Combinatorial optimization / Operations research / Mathematical optimization / Machine learning / Algorithm / Greedy algorithm / Heuristic / Knapsack problem

arXiv:1511.07147v1 [cs.LG] 23 NovA PAC Approach to Application-Specific Algorithm Selection∗ Rishi Gupta Tim Roughgarden

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-11-23 20:51:24
134Mathematics / Computational complexity theory / Geometry / Polygons / NP-complete problems / Euclidean plane geometry / Art gallery problem / Computational geometry / Vertex / APX

Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
135Graph theory / NP-complete problems / Longest path problem / Interval graph / Hamiltonian path / Independent set / Chordal graph / Indifference graph / Path / Permutation graph / Pathwidth / Graph coloring

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-06-12 14:16:54
136Theoretical computer science / Computational complexity theory / Mathematics / Constraint programming / NP-complete problems / Boolean algebra / Parameterized complexity / Boolean satisfiability problem / Constraint satisfaction problem / Exponential time hypothesis / Treewidth / Tree decomposition

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
137Graph theory / NP-complete problems / Discrete geometry / Independent set / FranklRdl graph / Lovsz number

A semidefinite programming hierarchy for geometric packing problems David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Isaac Newton Institute for Mathematical Sciences – July 2013

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
138Mathematics / Graph theory / Economy / Operations research / Matching / Combinatorial optimization / NP-complete problems / Assignment problem / Linear programming / Transportation theory / Inventory / Travelling salesman problem

J EPSILON Pi Mu Epsilon Journal Volume 2—Reprint

Add to Reading List

Source URL: www.pme-math.org

Language: English - Date: 2013-10-17 15:52:26
139Graph theory / Mathematics / Spanning tree / Axiom of choice / Tree / Minimum spanning tree / Ear decomposition / Graph connectivity / NP-complete problems / Biconnected component / Vertex cover

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-11-19 07:35:47
140Packing problems / Bin packing problem / Analysis of algorithms / Computer science / Mathematics / Online algorithms / Competitive analysis / Bin / Applied mathematics / Operations research / NP-complete problems

Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan† Tak-Wah Lam‡ ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-04-19 01:25:32
UPDATE