NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
31	Partial Searchlight Scheduling is Strongly PSPACE-complete Giovanni Viglietta∗ in 2-EXP. Whether SSP is NP-hard or even in NP is left in [2] as an open problem. More recently, in [4], the author introduced the Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2013-05-16 16:45:32
32	Planar 3SAT is NP-hard [Lichtenstein 1982] 𝛾𝛾 = 𝑎𝑎1 ∧ 𝑏𝑏1 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-10-04 16:20:42
33	CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION Tofigh Naghibi, Sarah Hoffmann, Beat Pfister Speech Processing Group, Computer Engineering and Networks Lab., ETH Zurich, Switzerland {naghib Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2013-09-03 07:19:08
34	CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA Add to Reading List Source URL: hunch.net Language: English - Date: 2003-09-18 19:47:10 Computational neuroscience Human-based computation Complexity classes CAPTCHA Computer security Computer vision Internet bot Turing test Artificial general intelligence Luis von Ahn Artificial intelligence NP
35	358 Int. J. Bio-Inspired Computation, Vol. 3, No. 6, 2011 Wisdom of artificial crowds algorithm for solving NP-hard problems Add to Reading List Source URL: cecs.louisville.edu Language: English - Date: 2015-09-21 11:15:09
36	Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied Add to Reading List Source URL: www.piercelab.caltech.edu Language: English - Date: 2010-09-08 02:56:32 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-hard NP-complete Dead-end elimination NP P Theoretical computer science Computational complexity theory Applied mathematics
37	Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions Add to Reading List Source URL: cognitiveharmony.net Language: English - Date: 2008-09-30 17:00:23 Complexity classes NP-hard NP-complete NP P versus NP problem P Reduction Decision problem Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
38	Approximation schemes for NP-hard geometric optimization problems: A survey Sanjeev Arora∗ Princeton University NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the tra Add to Reading List Source URL: www.cs.duke.edu - Date: 2007-04-04 18:30:18
39	Computer assisted proof of optimal approximability results Uri Zwick ∗ 3-SAT and a 21 + ratio for MAX 3-CSP are both NP-hard tasks. In [KZ97] and [Zwi98] it was shown that the validity We obtain computer assisted pro Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2001-10-11 06:26:21
40	PowerPoint template for scientific poster Add to Reading List Source URL: skelk.sdf-eu.org Language: English - Date: 2011-03-15 15:13:11 Genetic algorithms Abstract algebra Combinatorics Permutation Time complexity Mutation Computational complexity theory Algorithm NP-hard Theoretical computer science Applied mathematics Mathematics

UPDATE