Studies in Complexity and Cryptography
- Indbinding:
- Paperback
- Sideantal:
- 576
- Udgivet:
- 3. august 2011
- Størrelse:
- 155x31x235 mm.
- Vægt:
- 861 g.
- 8-11 hverdage.
- 7. december 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Studies in Complexity and Cryptography
This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists.
The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge.
All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives.
The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge.
All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives.
Brugerbedømmelser af Studies in Complexity and Cryptography
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Studies in Complexity and Cryptography findes i følgende kategorier:
- Business og læring > Computer og IT
- Business og læring > Videnskab
- Kunst og kultur
- Hobby og fritid > Sport
- Litteratur og litteraturstudier
- Reference, information og tværfaglige emner > Forskning og information: generelt > Kodeteori og kryptologi
- Økonomi, finans, erhvervsliv og ledelse
- Lægevidenskab og sygepleje
- Matematik og naturvidenskab > Matematik > Diskret matematik
- Idræt og udendørsaktiviteter > Idræt: generelt
- Databehandling og informationsteknologi > Programmering / softwareudvikling > Algoritmer og datastrukturer
- Databehandling og informationsteknologi > Datasikkerhed > Datakryptering
- Databehandling og informationsteknologi > Informatik > Matematisk datateori > Matematik til informatikfag
- Sundhed, relationer og personlig udvikling
© 2024 Pling BØGER Registered company number: DK43351621