NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
741	FCAT FLORIDA COMPREHENSIVE ASSESSMENT TEST Problem Solving Strategies Copyright Statement for this Assessment and Evaluation Services Publication Add to Reading List Source URL: fcit.usf.edu Language: English - Date: 2013-01-10 19:20:02 Operations research Psychology Systems engineering NP-complete problems Educational psychology Neuropsychological assessment Problem solving
742	Abstract Model Counting: a novel approach for Quantification of Information Leaks Quoc-Sang Phan Pasquale Malacaria Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Electronic design automation Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Quicken Interchange Format Java Pathfinder Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
743	Logic Puzzles booklet #3 ©Tim Peeters (http://www.home.zonnet.nl/kostunix/) The Line Game (*) All cells have to be covered by a line. Except the four black cells and the ones containing a number. These line Add to Reading List Source URL: www.home.zonnet.nl Language: English - Date: 2002-05-13 20:42:33** Behavior Logic puzzles NP-complete problems Crossword
744	Logic Puzzles booklet #5 ©2001 Tim Peeters (http://www.home.zonnet.nl/kostunix/) Sequences (-) Fill in the missing number on the question mark. 1. Add to Reading List Source URL: www.home.zonnet.nl Language: English* - Date: 2002-05-13 20:43:09 Human behavior Behavior Logic puzzles NP-complete problems Crossword
745	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
746	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
747	Fast Normalized Cut with Linear Constraints Linli Xu Wenye Li Dale Schuurmans Department of Computing Science University of Alberta Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2009-04-06 23:13:13 Matrix theory Mathematical optimization NP-complete problems Operations research Eigenvalues and eigenvectors Spectral clustering Graph partition Eigendecomposition of a matrix Segmentation Algebra Mathematics Linear algebra
748	Maximizing Social Influence in Nearly Optimal Time Christian Borgs∗ Michael Brautbar† Jennifer Chayes‡ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-09-22 20:59:44 NP-complete problems Hypergraph Submodular set function Bridge Graph partition Network theory Networks Belief propagation Randomized algorithm Graph theory Theoretical computer science Mathematics
749	Logic Puzzles booklet #4 ©Tim Peeters (http://www.home.zonnet.nl/kostunix/) Magic Square #1 (*) In every row, every column and on the two diagonals every number from 1 to 9 appears exactly once. Some number Add to Reading List Source URL: www.home.zonnet.nl Language: English - Date: 2002-07-22 15:35:11** Games Crossword Human behavior Publishing Sudoku Puzzle video games NP-complete problems Logic puzzles Leisure
750	Some Minesweeper Configurations Richard Kaye School of Mathematics The University of Birmingham Birmingham B15 2TT Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2007-05-31 06:58:26 Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP-complete Vehicle Identification Number Minesweeper P-complete NP Theoretical computer science Complexity classes Applied mathematics

UPDATE