Editors:
High quality selected papers
Unique visibility
State of the art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6650)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (36 chapters)
-
Front Matter
-
Research Contributions
About this book
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.
Keywords
- coding theory
- complexity classes
- computability
- computational complexity
- computational intractability
- cryptology
- graph computations
Editors and Affiliations
-
Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel
Oded Goldreich
Bibliographic Information
Book Title: Studies in Complexity and Cryptography
Book Subtitle: Miscellanea on the Interplay between Randomness and Computation
Editors: Oded Goldreich
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-22670-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-22669-4Published: 03 August 2011
eBook ISBN: 978-3-642-22670-0Published: 03 August 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 564
Number of Illustrations: 33 b/w illustrations
Topics: Theory of Computation, Cryptology, Formal Languages and Automata Theory, Discrete Mathematics in Computer Science, Algorithms