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.

Seller Inventory # 247167

Contact seller

Report this item

Bibliographic Details

Title: Using Hard Problems to Create Pseudorandom Generators (ACM Distinguished Dissertation).
Publisher: Mit Pr
Publication Date: 1992
Language: English
ISBN 10: 0262140519
ISBN 13: 9780262140515
Binding: Hardcover
Condition: as new

About this title

Synopsis

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.

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.

Noam Nisan is Lecturer in the Department of Computer Science at Hebrew University in Jerusalem. He received his doctoral degree from the University of California, Berkeley.

Contents: Introduction. Hardness vs. Randomness. Pseudorandom Generators for Logspace and Multiparty Protocols.

About the Author

Noam Nisan is Professor at the Institute of Computer Science and Engineering, Hebrew University of Jerusalem.

"About this title" may belong to another edition of this title.

Store Description

In business since 1923 we are specialized in law, philosophy and other scholarly books from the 16th - 20th century. We also carry a general stock and we have permanently in stock ca. 60.000 titles. Visit only by appointment. Member of ILAB and the NVVA, the Dutch Antiquarian Booksellers Association.

Visit Seller's Storefront

Association Member

Members of these associations are committed to maintaining the highest standards. They vouch for the authenticity of all items offered for sale. They provide expert and detailed descriptions, disclose all significant defects and/or restorations, provide clear and accurate pricing, and operate with fairness and honesty during the purchase experience.

Seller's business information

Kloof Booksellers & Scientia Verlag
Netherlands

Sale & Shipping Terms

Terms of Sale

Condition of the books is VG or better, unless otherwise stated. Books are subject to prior sale. Orders usually ship within 2-3 business days. Shipping of books outside the EU, or to commercial and institutional addresses in the EU is at buyers cost & risk. Airmail & insurance rates on request. No discounts possible on orders through Abebooks. The displayed shipping costs are based on books weighing 2.2 LB, or 1 KG. All disputes which may arise are subject to Dutch law. In such a case Amsterdam...

More Information

Shipping Terms

Orders usually ship within 2-3 business days. Shipping of books outside the EU, or to commercial and institional addresses in the EU is at buyers cost & risk.. Airmail & insurance rates on request. The displayed shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates from Netherlands to U.S.A.

Shipping rates from Netherlands to U.S.A.
Order quantity	14 to 60 business days	7 to 15 business days
First item	US$ 34.33	US$ 74.37

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.