NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
111	Universal Voting Protocol Tweaks to Make Manipulation Hard∗ Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2003-04-28 20:04:25 Voting theory Psephology Political philosophy Tactical voting IP NP Instant-runoff voting XTR Single winner electoral systems Voting Social choice theory
112	PDF Document Add to Reading List Source URL: www.unizar.es Language: English - Date: 2009-04-13 10:34:31 Complexity classes NP P versus NP problem P Bounded-error probabilistic polynomial Time complexity Oracle machine Reduction NP-hard Theoretical computer science Computational complexity theory Applied mathematics
113	PDF Document Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-01 17:32:46 Complexity classes NP-complete problems Approximation algorithms Mathematical optimization NP-complete NP-hard Optimization problem APX P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
114	PDF Document Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2007-05-24 22:16:31 Complexity classes NP-complete P versus NP problem NP-hard NP Boolean satisfiability problem P Bounded-error probabilistic polynomial NEXPTIME Theoretical computer science Computational complexity theory Applied mathematics
115	PDF Document Add to Reading List Source URL: www.csc.kth.se Language: English - Date: 2007-09-01 17:32:46 Complexity classes NP-complete problems Approximation algorithms Mathematical optimization NP-complete NP-hard Optimization problem APX P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
116	PDF Document Add to Reading List Source URL: www.claymath.org Language: English - Date: 2006-08-04 16:47:47 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
117	PDF Document Add to Reading List Source URL: ling.umd.edu Language: English - Date: 2009-08-01 00:43:08 Applied mathematics NP-complete Optimality theory NP-hard NP Hamiltonian path problem Complete Strongly NP-complete Co-NP Theoretical computer science Computational complexity theory Complexity classes
118	PDF Document Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:33 Complexity classes Robertson–Seymour theorem Minor NP-complete P versus NP problem NP-hard P Time complexity Vertex cover Theoretical computer science Computational complexity theory Mathematics
119	Untitled Add to Reading List Source URL: alexandria.tue.nl Language: English - Date: 2002-05-14 04:13:37 Complexity classes School timetable P-complete NP-hard Graph coloring NP Combinatorial optimization PP Assignment problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE