OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Using hard problems to create pseudorandom generators
Bookmark Share

Text

Using hard problems to create pseudorandom generators

Nisan, Noam. - Personal Name;

"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.""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."OCLC-licensed vendor bibliographic record.


Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cambridge : The MIT Press., 1992
Collation
1 online resource (vi, 43 pages).
Language
English
ISBN/ISSN
9780262256728
Classification
NONE
Content Type
text
Media Type
computer
Carrier Type
-
Edition
-
Subject(s)
Random number generators.
Computational complexity.
Specific Detail Info
-
Statement of Responsibility
Noam Nisan
Other Information
Cataloger
jemadi
Source
-
Validator
jemadi
Digital Object Identifier (DOI)
DOI: https://doi.org/10.7551/mitpress/7052.001.0001
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
  • Using Hard Problems to Create Pseudorandom Generators
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?