NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
721	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 15 May 2013 This question paper has 4 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2014-02-28 00:18:08 Applied mathematics Binomial coefficient Fractional cascading Mathematics Logarithms NP-complete problems
722	Mungo’s Crossword N016 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-05-05 21:40:39 Crosswords NP-complete problems Cryptic crossword
723	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
724	ENUMERATING 9 x 9 SUDOKU GRIDS Shi Fangying 1, Zhang Mengshi 1 and Helmer Aslaksen 2 1 2 Add to Reading List Source URL: www.math.nus.edu.sg Language: English - Date: 2008-09-17 23:49:22 Logic puzzles Latin squares NP-complete problems Mathematics of Sudoku Grid plan Matrix Sudoku algorithms Mathematics Recreational mathematics Sudoku
725	Co-Clustering Under the Maximum Norm Laurent Bulteau? , Vincent Froese?? , Sepp Hartung, and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany , Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-11 10:18:15 Biclustering 2-satisfiability NP Matrix Permutation Consensus clustering Complete-linkage clustering Statistics Cluster analysis Mathematics
726	Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-03-13 14:59:55 NP-complete problems Graph partition Clique Graph coloring Vertex Connected component Breadth-first search Connectivity Tree Graph theory Theoretical computer science Mathematics
727	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
728	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-06-19 10:42:56 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Parameterized complexity NP-complete P versus NP problem NP FO Theoretical computer science Computational complexity theory Applied mathematics
729	Mungo’s Crossword N024 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-06-22 20:50:09 Saintpaulia Human behavior NP-complete problems Crosswords Cryptic crossword
730	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics

UPDATE