NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
91	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: 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
92	A Simple Model to Generate Hard Satisfiable Instances Ke Xu1 1 Fr´ed´eric Boussemart2 Add to Reading List Source URL: www.nlsde.buaa.edu.cn Language: English - Date: 2005-04-26 01:56:54 Applied mathematics NP-complete problems Electronic design automation Formal methods Logic in computer science Boolean satisfiability problem Constraint satisfaction problem Constraint satisfaction Local search Theoretical computer science Constraint programming Mathematics
93	J. Cryptology[removed]OF1–OF35 DOI: [removed]s00145[removed] © 2006 International Association for Cryptologic Research Trapdoor Hard-to-Invert Group Add to Reading List Source URL: www.bolet.org Language: English - Date: 2013-06-04 22:24:52 Public-key cryptography One-way function Trapdoor function Password-authenticated key agreement Random oracle PP NP Oracle machine RSA Cryptography Cryptographic protocols Cryptographic hash functions
94	Classification of computational problems Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague FJFI, [removed] Add to Reading List Source URL: kolokvium.fjfi.cvut.cz Language: English - Date: 2014-04-09 11:50:42 Applied mathematics NP P versus NP problem Polynomial EXPTIME P NTIME NP-hard IP Theoretical computer science Computational complexity theory Complexity classes
95	Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30 Add to Reading List Source URL: www3.math.tu-berlin.de Language: English Complexity classes Matroid theory NP-complete problems Dimension Matroid Cubic graph Induced path NP-hard Time complexity Theoretical computer science Graph theory Mathematics
96	Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ † Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-01-15 13:02:20 Complexity classes NP P versus NP problem PP Sparse language P Cook–Levin theorem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
97	Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:14:50 Complexity classes NP-complete P Time complexity Reduction Many-one reduction P versus NP problem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
98	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: captcha.net Language: English - Date: 2009-07-22 18:52:06 Science Artificial intelligence Alan Turing Philosophy of artificial intelligence Turing test Luis von Ahn Strong AI NP IP Applied mathematics CAPTCHA Human-based computation
99	Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-09-05 18:26:13 NP-complete problems Complexity classes Holographic algorithm NP-complete Matching FKT algorithm NP-hard P versus NP problem NP Theoretical computer science Computational complexity theory Mathematics
100	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-06-15 12:40:47 Probability theory NP-complete problems Logic in computer science Elementary mathematics NP-hard problems MAX-3SAT Boolean satisfiability problem Interpretation Belief propagation Mathematics Theoretical computer science Applied mathematics

UPDATE