Co-NP-complete - PDFSEARCH.IO - Document Search Engine

Co-NP-complete
Results: 26

#	Item
1	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
2	P-matrix recognition is co-NP-complete Jan Foniok ETH Zurich, Institute for Operations Research R¨amistrasse 101, 8092 Zurich, Switzerland Add to Reading List Source URL: www.ifor.math.ethz.ch Language: English - Date: 2007-10-22 07:27:16 Matrix theory Linear algebra Matrices Algebra Determinant Matrix Square matrix Eigenvalues and eigenvectors Matrix exponential Positive-definite matrix
3	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
4	PHOTO: V. SLADON 175 YEARS – 50 GREAT CATHOLICS / Michael Walsh on Barbara Ward A friend, a retired senior lecturer on international Add to Reading List Source URL: www.thetablet.co.uk Language: English Old Testament Hebrew Bible Abiathar David Crossword Barbara Ward Michmash Solomon Sword of the Spirit NP-complete problems Kings of ancient Judah Nevi\'im
5	The Complexity of Global Constraints Christian Bessiere Emmanuel Hebrard and Brahim Hnich and Toby Walsh∗ LIRMM Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:27 Computer programming Local consistency Constraint satisfaction Constraint logic programming Co-NP-complete NP-complete Decomposition method Complexity of constraint satisfaction Constraint programming Software engineering Theoretical computer science
6	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY All lectures will take place in Engineering Quad, Building EF, Seminar Room EF122 http://www.fpt.wikidot.com Tuesday, 3 0 M archMorning Session. Chair: Frances Rosamo Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:50:14 Computational complexity theory Michael Fellows Parameterized complexity NP-complete problems Vertex cover Bioinformatics Theoretical computer science Applied mathematics Mathematics
7	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
8	Su Doku the Number-Placing Puzzle 3 Add to Reading List Source URL: www.cleavebooks.co.uk Language: English - Date: 2007-05-13 18:37:34 Recreational mathematics Crossword Sudoku Matrix Sudoku algorithms Word search NP-complete problems Mathematics Logic puzzles
9	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
10	Extreme Sudoku solving with Ruby Matt Westcott Why a sudoku solver? Add to Reading List Source URL: matt.west.co.tt Language: English Recreational mathematics NP-complete problems Logic puzzles Sudoku Ruby Lookahead Iterator Sudoku algorithms Computing Software engineering Mathematics