P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
1	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:57:12 Computational complexity theory Logic Complexity classes Mathematical logic PSPACE FO Second-order logic P versus NP problem Constraint satisfaction problem NP P Constraint satisfaction
2	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-01-06 16:13:01 Computational complexity theory Theory of computation Complexity classes NP Clique problem Linear programming P Algorithm Time complexity Optimization problem Book:Graph Theory P versus NP problem
3	Mining Relations from Git Commit Messages — an Experience Report Rikard Andersson∗ , Morgan Ericsson†∗ , Anna Wingkvist† ∗ Chalmers \| University of Gothenburg Gothenburg, Sweden Add to Reading List Source URL: www2.lingfil.uu.se Language: English - Date: 2014-10-16 02:36:21 Linguistics Language Cognitive science Computational linguistics Natural language processing Named-entity recognition Relex Information extraction Statistical classification P versus NP problem Part-of-speech tagging Syntax
4	ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P
5	Public Key Cryptography Public Key Cryptography • Symmetric Key: – Same key used for encryption and decrypiton – Same key used for message integrity and validation Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Cryptography Computational complexity theory Knapsack problem Cipher Public-key cryptography Encryption Symmetric-key algorithm Key P versus NP problem MerkleHellman knapsack cryptosystem RSA
6	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
7	Course Mechanics Inf1CG runs weeks 1–10, with 30 slots: 29 lectures, no lectures in innovative learning week. Language: Introduction Add to Reading List Source URL: www.inf.ed.ac.uk Language: English - Date: 2016-01-14 16:31:01 Syntax Cognitive science Grammar Complexity classes Philosophy of language Semiotics Phrase NP P versus NP problem Left corner
8	The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:55:46 Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory
9	MCS 441 – Theory of Computation I Spring 2016 Problem Set 5∗ Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-04-18 15:41:22 Complexity classes P versus NP problem NP IP P-complete
10	Parameterized Average-Case Complexity of the Hypervolume Indicator Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:47 Analysis of algorithms Worst-case complexity Parameterized complexity P versus NP problem