Using Hard Problems to Create Pseudorandom Generators

Using Hard Problems to Create Pseudorandom Generators

Versandkostenfrei!
Sofort lieferbar
21,99 €
inkl. MwSt.
PAYBACK Punkte
11 °P sammeln!
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 randomi...