Torrent Hash - Hash of all existing torrents
Please, pay attention to the fact that you are about to download the torrent NOT from torhash.net
torhash.net is just a torrent search engine, no torrents are hosted here.

Studies in Complexity and Cryptography (2011)

Infohash:

5E539F3BD9826DA593A93ACBA412E439758DDE14

Type:

Other Ebooks

Title:

Studies in Complexity and Cryptography (2011)

Category:

Other/E-books

Uploaded:

2011-11-11 (by freaktorrent07)

Description:

Studies in Complexity and Cryptography Product Description: 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. Author(s): Oded Goldreich Publisher: Springer Date: 2011-09-28 Pages: 574 ISBN13: 9783642226694

Tags:

  1. Studies in Complexity and Cryp

Files count:

1

Size:

7.28 Mb

Trackers:

udp://tracker.openbittorrent.com:80
udp://open.demonii.com:1337
udp://tracker.coppersurfer.tk:6969
udp://exodus.desync.com:6969

Comments:

ODBC (2011-12-26)

Thank you for sharing!