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.
Contents
Introduction · Hardness vs. Randomness · Pseudorandom Generators for Logspace and Multiparty Protocols
"synopsis" may belong to another edition of this title.
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.
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Using Hard Problems to Create Pseudorandom Generators 0.35. Book. Seller Inventory # BBS-9780262640527
Quantity: 5 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580085047
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780262640527
Quantity: 15 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 53. Seller Inventory # 2697024151
Quantity: 4 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780262640527
Quantity: 15 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 53. Seller Inventory # 96454472
Quantity: 4 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 56 pages. 10.70x8.20x0.50 inches. In Stock. Seller Inventory # x-026264052X
Quantity: 2 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 53. Seller Inventory # 1897024157
Quantity: 4 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9780262640527
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Über den AutorNoam Nisan is Professor at the Institute of Computer Science and Engineering, Hebrew University of Jerusalem.KlappentextNoam Nisan continues the investigation into the power. Seller Inventory # 543288791
Quantity: Over 20 available