Using Hard Problems to Create Pseudorandom Generators
Nisan, Noam
Sold by GreatBookPrices, Columbia, MD, U.S.A.
AbeBooks Seller since April 6, 2009
New - Soft cover
Condition: New
Ships within U.S.A.
Quantity: Over 20 available
Add to basketSold by GreatBookPrices, Columbia, MD, U.S.A.
AbeBooks Seller since April 6, 2009
Condition: New
Quantity: Over 20 available
Add to basketRandomization 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. Nisan first establishes a precise connection between computational complexity and pseudorandom number generation, revealing that efficient deterministic simulation of randomized algorithms is possible under much weaker assumptions than was previously known, and bringing to light new consequences concerning the power of random oracles. Using a remarkable argument based on multiparty communication complexity, Nisan then constructs a generator that is good against all tests computable in logarithmic space. A consequence of this result is a new construction of universal traversal sequences.
Contents
Introduction - Hardness vs. Randomness - Pseudorandom Generators for Logspace and Multiparty Protocols
"About this title" may belong to another edition of this title.
Company Name: GreatBookPrices
Legal Entity: Expert Trading, LLC
Address: 9220 Rumsey Road, Ste 101, Columbia MD 21046
Email address: CustomerService@SuperBookDeals.com
Phone number: 410-964-0026
consumer complaints can be addressed to address above
Registration #: 52-1713923
Authorized representative: Danielle Hainsey
Internal processing of your order will take about 1-2 business days. Please allow an additional 4-14 business days for Media Mail delivery. We have multiple ship-from locations - MD,IL,NJ,UK,IN,NV,TN & GA
| Order quantity | 8 to 14 business days | 5 to 14 business days |
|---|---|---|
| First item | US$ 2.64 | US$ 2.64 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.