NP-complete

Results: 1728



#Item
811Human behavior / Puzzles / Leisure / Crossword / Sudoku / Thinking outside the box / Games / NP-complete problems / Problem solving

Paradox Issue 2, 2011 T HE M AGAZINE OF THE M ELBOURNE U NIVERSITY M ATHEMATICS AND S TATISTICS S OCIETY Page 2

Add to Reading List

Source URL: www.ms.unimelb.edu.au

Language: English - Date: 2011-11-19 03:23:11
812Coding theory / Analysis of algorithms / Computational complexity theory / Closest string / Hamming distance / Time complexity / Algorithmica / Theoretical computer science / Applied mathematics / NP-complete problems

Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2013-07-26 10:03:32
813Graph / Planar graph / Unit disk graph / Geographic routing / Graph theory / Theoretical computer science / NP-complete problems

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:29
814NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph operations / Graph coloring / Bidimensionality / Kernelization / Clique / Dominating set / Theoretical computer science / Graph theory / Computational complexity theory

Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 04:47:38
815Complexity classes / Mathematical optimization / Structural complexity theory / Computability theory / P versus NP problem / NP-complete / NP / PP / Analog computer / Theoretical computer science / Computational complexity theory / Applied mathematics

THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2001-11-25 03:18:59
816NP-complete problems / Network theory / Operations research / Travelling salesman problem / Motion planning / Robotics / Shortest path problem / Mobile robot / Robot / Theoretical computer science / Mathematics / Graph theory

Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari ·

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2014-06-13 19:42:54
817Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability Modulo Theories / AMPL / X Window System / Theoretical computer science / Computing / Software engineering

Programming with constraint solvers toward a shared infrastructure for code checking, angelic execution, debugging, and synthesis

Add to Reading List

Source URL: homes.cs.washington.edu

Language: English - Date: 2014-08-13 19:27:02
818NP-complete problems / Graph coloring / Graph theory / NP-complete / One-in-three 3SAT / 2-satisfiability / Theoretical computer science / Mathematics / Computational complexity theory

manhat-conn-xact-color.dvi

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
819Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
820NP-complete problems / Applied mathematics / Graph theory / Theoretical computer science / Mathematics / Graph coloring

Introduction Extensions of G RAPH M OTIF MIN-SUB and MIN-ADD CGM Conclusion

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2011-09-22 14:07:17
UPDATE