Complexity Theory and Cryptology: An Introduction to Cryptocomplexity: Texts in Theoretical Computer Science. An EATCS Series
Autor Jörg Rotheen Limba Engleză Paperback – 21 oct 2010
This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 332.52 lei 43-57 zile | |
Springer Berlin, Heidelberg – 21 oct 2010 | 332.52 lei 43-57 zile | |
Hardback (1) | 337.37 lei 43-57 zile | |
Springer Berlin, Heidelberg – 22 iul 2005 | 337.37 lei 43-57 zile |
Din seria Texts in Theoretical Computer Science. An EATCS Series
- 20% Preț: 122.75 lei
- 20% Preț: 331.57 lei
- 20% Preț: 312.66 lei
- 20% Preț: 321.62 lei
- 20% Preț: 418.34 lei
- 20% Preț: 335.42 lei
- Preț: 373.00 lei
- 20% Preț: 582.60 lei
- Preț: 452.42 lei
- 20% Preț: 706.30 lei
- 15% Preț: 574.37 lei
- Preț: 388.13 lei
- 20% Preț: 352.23 lei
- 20% Preț: 322.60 lei
- 20% Preț: 971.15 lei
- 20% Preț: 584.67 lei
- 20% Preț: 331.89 lei
- 20% Preț: 354.70 lei
- 20% Preț: 626.47 lei
- 20% Preț: 637.04 lei
- Preț: 383.06 lei
- 20% Preț: 329.48 lei
- 15% Preț: 692.14 lei
- 20% Preț: 572.00 lei
- 20% Preț: 701.96 lei
- 20% Preț: 593.65 lei
- 20% Preț: 421.45 lei
- 20% Preț: 505.30 lei
- 20% Preț: 488.45 lei
- Preț: 376.93 lei
- 20% Preț: 526.69 lei
- 20% Preț: 326.76 lei
Preț: 332.52 lei
Preț vechi: 415.65 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
63.64€ • 66.33$ • 52.98£
63.64€ • 66.33$ • 52.98£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642060540
ISBN-10: 3642060544
Pagini: 496
Ilustrații: XII, 478 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.69 kg
Ediția:Softcover reprint of hardcover 1st ed. 2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642060544
Pagini: 496
Ilustrații: XII, 478 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.69 kg
Ediția:Softcover reprint of hardcover 1st ed. 2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
to Cryptocomplexity.- Foundations of Computer Science and Mathematics.- Foundations of Complexity Theory.- Foundations of Cryptology.- Hierarchies Based on NP.- Randomized Algorithms and Complexity Classes.- RSA Cryptosystem, Primality, and Factoring.- Other Public-Key Cryptosystems and Protocols.
Recenzii
From the reviews:
"The book … provides introduction to both cryptology and complexity theory with special emphasis on their mutual pervasion. … All chapters have a set of exercises and problems as well as a summary describing the historical development of the notions and results presented and providing bibliographic remarks and references for further study. A comprehensive bibliography makes the book a valuable source for the researchers, teachers, and even practitioners working in complexity theory and cryptology. A useful book." (Jozef Vyskoc, Zentralblatt MATH, Vol. 1082, 2006)
"This book of 478 pages is an introduction to complexity theory and cryptology. It is very well suited for the reader who wants to learn these two closely related areas in theoretical computer science. … The nice aspect of this book is that it treats the two topics in an integrated approach. … The book could be used as a textbook for undergraduate and graduate students in computer sciences, mathematics, and engineering. Each chapter ends with pages of summary and bibliographic remarks." (Yongge Wang, Mathematical Reviews, Issue 2006 c)
"The book is intended as a textbook for advanced undergraduate and graduate students and is based on author’s long experience of teaching a series of interrelated courses on cryptocomplexity. … the book contains a very well organized index. … The book is well written and interesting. … I like the book and I think it is a good textbook for graduate students and for advanced undergraduate students. … a solid textbook for advanced students and a very good, comprehensive, reference for researchers." (Piotr Faliszewski, SIGACT News, Vol. 38 (2), 2007)
"The book … provides introduction to both cryptology and complexity theory with special emphasis on their mutual pervasion. … All chapters have a set of exercises and problems as well as a summary describing the historical development of the notions and results presented and providing bibliographic remarks and references for further study. A comprehensive bibliography makes the book a valuable source for the researchers, teachers, and even practitioners working in complexity theory and cryptology. A useful book." (Jozef Vyskoc, Zentralblatt MATH, Vol. 1082, 2006)
"This book of 478 pages is an introduction to complexity theory and cryptology. It is very well suited for the reader who wants to learn these two closely related areas in theoretical computer science. … The nice aspect of this book is that it treats the two topics in an integrated approach. … The book could be used as a textbook for undergraduate and graduate students in computer sciences, mathematics, and engineering. Each chapter ends with pages of summary and bibliographic remarks." (Yongge Wang, Mathematical Reviews, Issue 2006 c)
"The book is intended as a textbook for advanced undergraduate and graduate students and is based on author’s long experience of teaching a series of interrelated courses on cryptocomplexity. … the book contains a very well organized index. … The book is well written and interesting. … I like the book and I think it is a good textbook for graduate students and for advanced undergraduate students. … a solid textbook for advanced students and a very good, comprehensive, reference for researchers." (Piotr Faliszewski, SIGACT News, Vol. 38 (2), 2007)
Textul de pe ultima copertă
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas.
This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Caracteristici
First book focusing on the interrelation of Cryptology and Complexity Theory Includes supplementary material: sn.pub/extras