Using hard problems to create pseudorandom generators / (Record no. 72968)

000 -LEADER
fixed length control field 03722nam a2200517 i 4500
001 - CONTROL NUMBER
control field 6267312
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204626.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151223s2003 mau ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262256728
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
082 00 - CLASSIFICATION NUMBER
Call Number 519.4
100 1# - AUTHOR NAME
Author Nisan, Noam,
245 10 - TITLE STATEMENT
Title Using hard problems to create pseudorandom generators /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (vi, 43 pages).
490 1# - SERIES STATEMENT
Series statement ACM distinguished dissertations
520 ## - SUMMARY, ETC.
Summary, etc 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.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267312
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c1992.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [2003]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/23/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Random number generators.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational complexity.

No items available.