NP-completeness - PDFSEARCH.IO - Document Search Engine

NP-completeness
Results: 54

#	Item
41	Informatique Fondamentale IMA S8 Cours 4 : graphs, problems and algorithms on graphs, (notions of) NP completeness Laure Gonnord http://laure.gonnord.org/pro/teaching/ Add to Reading List Source URL: laure.gonnord.org Language: English - Date: 2011-04-08 12:38:58 Directed graph Graph theory Directed acyclic graph Graph
42	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
43	On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2000-06-09 02:38:14
44	Making Σ-Protocols Non-Interactive without Random Oracles Pyrros Chaidos, Jens Groth University College London Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-27 08:17:32 Applied mathematics Mathematics Complexity classes Metalogic Zero-knowledge proof Soundness IP NP Completeness Theoretical computer science Cryptographic protocols Proof theory
45	NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21
46	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
47	Motivation COMS21103 NP-completeness Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes NP-complete NP-hard P versus NP problem NP Cook–Levin theorem Boolean satisfiability problem PP P Theoretical computer science Computational complexity theory Applied mathematics
48	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
49	Separation of NP-completeness Notions A. Pavan Alan L Selman ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-03-30 11:54:28 Complexity classes Models of computation Computability theory Mathematical optimization NP Time complexity Oracle machine P Turing machine Theoretical computer science Computational complexity theory Applied mathematics
50	Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-12-13 15:38:53 NP-complete NP P Combinatory logic P versus NP problem Computational complexity theory Theoretical computer science Complexity classes Applied mathematics

UPDATE