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/ Informatique Fondamentale IMA S8 Cours 4 : graphs, problems and algorithms on graphs, (notions of) NP completeness Laure Gonnord http://laure.gonnord.org/pro/teaching/](https://www.pdfsearch.io/img/c7ede8cdcf8fb499cf144fe556aec4eb.jpg) | Add to Reading ListSource URL: laure.gonnord.orgLanguage: English - Date: 2011-04-08 12:38:58
|
---|
42![ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV:](https://www.pdfsearch.io/img/0a51b77791dd4e5d6fd7d6caea9480a3.jpg) | Add to Reading ListSource URL: www.mrfellows.netLanguage: English - Date: 2009-10-14 09:20:30
|
---|
43![On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000 On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000](https://www.pdfsearch.io/img/4ab04d6ecc71b342d92f95751b0ad57f.jpg) | Add to Reading ListSource URL: www.ics.uci.eduLanguage: English - Date: 2000-06-09 02:38:14
|
---|
44![Making Σ-Protocols Non-Interactive without Random Oracles Pyrros Chaidos, Jens Groth University College London Making Σ-Protocols Non-Interactive without Random Oracles Pyrros Chaidos, Jens Groth University College London](https://www.pdfsearch.io/img/17fefc1521a23413723b19e8cd369feb.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2015-03-27 08:17:32
|
---|
45![NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can](https://www.pdfsearch.io/img/6a6e03a9fda1d8c8b7bfeb8ffbe0b50f.jpg) | Add to Reading ListSource URL: www.cs.bris.ac.ukLanguage: English - Date: 2014-03-11 09:18:21
|
---|
46![COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro](https://www.pdfsearch.io/img/a36b6010d27bcfcde20fa31408b2cd1b.jpg) | Add to Reading ListSource URL: www.cs.bris.ac.ukLanguage: English - Date: 2014-01-08 09:09:08
|
---|
47![Motivation COMS21103 NP-completeness Motivation COMS21103 NP-completeness](https://www.pdfsearch.io/img/45966266cb05485d31e7b17abd0b5683.jpg) | Add to Reading ListSource URL: www.cs.bris.ac.ukLanguage: English - Date: 2014-01-08 09:09:08
|
---|
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 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](https://www.pdfsearch.io/img/87846deae0848b35b0b6e409b9a19add.jpg) | Add to Reading ListSource URL: drops.dagstuhl.deLanguage: English - Date: 2010-03-04 08:18:12
|
---|
49![Separation of NP-completeness Notions A. Pavan Alan L Selman ∗ Separation of NP-completeness Notions A. Pavan Alan L Selman ∗](https://www.pdfsearch.io/img/6d5955ee59025e936536272df7ae7046.jpg) | Add to Reading ListSource URL: www.cse.buffalo.eduLanguage: English - Date: 2001-03-30 11:54:28
|
---|
50![Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2 Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2](https://www.pdfsearch.io/img/ef136d1a5ed10b76054d134cbb2fcb14.jpg) | Add to Reading ListSource URL: www.cse.buffalo.eduLanguage: English - Date: 2001-12-13 15:38:53
|
---|