NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
101	Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2009-10-30 11:58:51 Mathematical optimization Linear programming Computational complexity theory Combinatorial optimization Operations research Semidefinite programming Linear programming relaxation Relaxation Constraint satisfaction problem Theoretical computer science Mathematics Applied mathematics
102	Some practical experiences of hard graph problems Keith Briggs [removed] Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-06-08 04:34:22 Graph coloring Clique Independent set Fractional coloring Clique problem Graph theory Theoretical computer science NP-complete problems
103	Weighted Electoral Control Piotr Faliszewski AGH University Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2013-07-28 10:53:34 NP-hard NP-complete NP Washington State Judicial elections Theoretical computer science Complexity classes Applied mathematics
104	Control in the Presence of Manipulators: Cooperative and Competitive Cases Zack 1 Fitzsimmons, Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2013-07-28 10:49:33 P Complexity classes Polynomial hierarchy NP-hard
105	THE P VERSUS NP PROBLEM STEPHEN COOK Add to Reading List Source URL: www.claymath.org Language: English - Date: 2013-08-12 10:39:14 Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
106	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
107	ICM 2002 • Vol. I • 245^272 Mathematical Foundations of Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:56:38 Complexity classes Pseudorandomness Analysis of algorithms Probabilistic complexity theory One-way function Hard-core predicate NP P versus NP problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
108	A Survey of 3sum-Hard Problems James King [removed] Add to Reading List Source URL: www.cs.mcgill.ca Language: English - Date: 2004-12-20 06:07:32 3SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory
109	Technical Report CS2008[removed]Department of Computer Science and Engineering Add to Reading List Source URL: charlotte.ucsd.edu Language: English - Date: 2008-01-23 16:06:35 Differential geometry MAXEkSAT Constructible universe NP-hard problems NP-complete problems
110	Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y Add to Reading List Source URL: www.cs.virginia.edu Language: English - Date: 1999-10-25 15:38:00 Spanning tree NP-complete problems Steiner tree problem NP-hard problems Quasi-bipartite graph Minimum spanning tree Rectilinear Steiner tree Vertex cover Matching Graph theory Theoretical computer science Mathematics

UPDATE