Deutsch  Français  Nederlands 

Nisan, Noam - Using Hard Problems to Create Pseudorandom Generators (ACM Distinguished Dissertation).

Cambridge, MA: The MIT Press, 1992. Hardcover. 53 pp.- Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic complexity classes by pursuing the idea of emulating randomness, or pseudorandom generation. Pseudorandom generators reduce the number of random bits required by randomized algorithms, enable the construction of certain cryptographic protocols, and shed light on the difficulty of simulating randomized algorithms by deterministic ones. The research described here deals with two methods of constructing pseudorandom generators from hard problems and demonstrates some surprising connections between pseudorandom generators and seemingly unrelated topics such as multiparty communication complexity and random oracles. English text. Condition : as new. Mailorder only - Alleen verzending mogelijk. Book condition : as new. ISBN 9780262140515.
EUR 25.00 [Appr.: US$ 28.92 | £UK 22 | JP¥ 4275] Book number #247167

is offered by:


Kloof Booksellers & Scientia Verlag
, Limmerick 7, 1046 AR Amsterdam, The Netherlands | Fax: +31 (0)20 627 1395
Email: kloof@xs4all.nl
Member of ILAB 




  Order this book

Ask for information

Back to your search results