Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow
| The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow |
| Autore | Fortnow Lance <1963-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
| Descrizione fisica | 1 online resource (189 p.) |
| Disciplina | 511.3/52 |
| Soggetto topico |
NP-complete problems
Computer algorithms |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-4008-4661-7
1-299-15656-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
| Record Nr. | UNINA-9910452419303321 |
Fortnow Lance <1963->
|
||
| Princeton, : Princeton University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow
| The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow |
| Autore | Fortnow Lance <1963-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
| Descrizione fisica | 1 online resource (189 p.) |
| Disciplina | 511.3/52 |
| Soggetto topico |
NP-complete problems
Computer algorithms |
| Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
| ISBN |
1-4008-4661-7
1-299-15656-8 |
| Classificazione | COM051300MAT015000MAT017000MAT034000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
| Record Nr. | UNINA-9910779319903321 |
|
Fortnow Lance <1963->
|
||
| Princeton, : Princeton University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow
| The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow |
| Autore | Fortnow Lance <1963-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
| Descrizione fisica | 1 online resource (189 p.) |
| Disciplina | 511.3/52 |
| Soggetto topico |
NP-complete problems
Computer algorithms |
| Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
| ISBN |
1-4008-4661-7
1-299-15656-8 |
| Classificazione | COM051300MAT015000MAT017000MAT034000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
| Record Nr. | UNINA-9910818849503321 |
|
Fortnow Lance <1963->
|
||
| Princeton, : Princeton University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||