NP-completeness - PDFSEARCH.IO - Document Search Engine

NP-completeness
Results: 54

#	Item
51	DAVID S. JOHNSON Address: 523 Computer Science Building Mail Code 0401 Department of Computer Science Add to Reading List Source URL: davidsjohnson.net Language: English - Date: 2014-01-22 11:11:57 Complexity classes Bin packing problem NP-complete ACM SIGACT Crossing number Linear programming Randomized algorithm Edward G. Coffman Jr. Computers and Intractability: A Guide to the Theory of NP-Completeness Theoretical computer science Applied mathematics Computational complexity theory
52	A Brief History of NP-Completeness, 1954–2012 David S. Johnson Mathematics subject classification: 68-03, 68Q17, 68Q25, 68W25, 90C05, 90C22 Add to Reading List Source URL: www.research.att.com Language: English - Date: 2012-09-06 18:30:18 Complexity classes NP-complete Cook–Levin theorem P versus NP problem NP-hard NP Stephen Cook Clique problem P Theoretical computer science Computational complexity theory Applied mathematics
53	Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer Add to Reading List Source URL: ovid.cs.depaul.edu Language: English - Date: 2008-10-05 12:49:10 Boolean algebra Logic in computer science NP-complete problems Combinatorics Boolean satisfiability problem Electronic design automation Conjunctive normal form Partition True quantified Boolean formula Theoretical computer science Mathematics Computational complexity theory
54	COMPLEXITY AND COMPLETENESS OF FINDING ANOTHER SOLUTION AND ITS APPLICATION TO PUZZLES Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2003-05-03 02:38:34 Applied mathematics NP-complete P versus NP problem EXPTIME PSPACE-complete NP P-complete P Reduction Theoretical computer science Computational complexity theory Complexity classes