NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
821	Generalising Number Patterns Seven Series-ous Secrets Teacher’s Notes These exercises, activities and games are designed for students to use independently or in small groups to practise number properties. Some involve Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:13:05 Sudoku NP-complete problems Puzzle Number Fibonacci number Mathematics of Sudoku Sudoku algorithms Mathematics Logic puzzles Recreational mathematics
822	Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu Add to Reading List Source URL: www.umiacs.umd.edu Language: English - Date: 2010-08-02 09:34:23 Distributed computing architecture MapReduce Parallel computing NP-complete problems PageRank Eulerian path Graph Topological graph theory Connected component Graph theory Mathematics Theoretical computer science
823	Problem Solving Methods ___________ Methods Checklist Use to record the range of methods you know, use or/and have experienced. Notice methods that may need development. Solve a problem in several ways using different m Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:13:20 Education Neuropsychological assessment Problem solving Mathematical problem Problem Theoretical computer science NP-complete How to Solve It Mathematics Mathematics education Educational psychology
824	A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:19:34 Analysis of algorithms Parameterized complexity NP-complete problems Kernelization Time complexity Vertex cover Algorithm Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
825	A First Step Towards Resilient Graph Partitioning for Electrical Grids Nana Arizumi, Kazuhiro Minami, Tomoya Tanjo, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {arizumi, kminami, tanjo, hm2 Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:04 NP-complete problems Graph partition Graph Connected component Cluster analysis Graph coloring Planar separator theorem Consensus clustering Graph theory Theoretical computer science Mathematics
826	Introduction Parameterized Algorithms Parameterized Hardness Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-13 19:09:20 NP-complete problems Graph coloring Connectivity Graph Topology Graph theory Theoretical computer science Mathematics
827	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
828	Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-23 13:36:27 Operations research Dynamic programming NP-complete problems Mathematical optimization Combinatorics Algorithm Greedy algorithm Knapsack problem Longest increasing subsequence Mathematics Theoretical computer science Applied mathematics
829	Pick 3 or Pickanother NP–complete 3-Dimensional Matching Variant Marzio De Biasi marziodebiasi [at] gmail [dot] com July 2014 Add to Reading List Source URL: www.nearly42.org Language: English - Date: 2014-07-31 19:07:02 Matching 3-dimensional matching Combinatorics Exact cover Numerical 3-dimensional matching Mathematics NP-complete problems Applied mathematics
830	A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2008-01-02 07:43:53 Analytic number theory Meromorphic functions Degree distribution Scale-free network Riemann zeta function Degree Random graphs NP-complete problems Dominating set Graph theory Mathematics Mathematical analysis

UPDATE