Isbn: 9780262140515 - using hard problems to create pseudorandom generators (acm distinguished dissertation) (1 resultados)

Condición: as new. 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. Condition : as new copy. ISBN 9780262140515. Keywords : , Random number generators.…