000			03654nam a2200505 i 4500
001			6267312
003			IEEE
005			20190220121646.0
006			m o d
007			cr |n|||||||||
008			151223s2003 mau ob 001 eng d
010			_z 91040779 (print)
020			_a9780262256728 _qelectronic
020			_z0262140519 _qprint
020			_z9780262640527 _qprint
035			_a(CaBNVSL)mat06267312
035			_a(IDAMS)0b000064818b42c2
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA298 _b.N57 1991eb
082	0	0	_a519.4 _220
100	1		_aNisan, Noam, _eauthor.
245	1	0	_aUsing hard problems to create pseudorandom generators / _cNoam Nisan.
264		1	_aCambridge, Massachusetts : _bMIT Press, _cc1992.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2003]
300			_a1 PDF (vi, 43 pages).
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aACM distinguished dissertations
502			_aRevision of the author's thesis (Ph. D.)--University of California, Berkeley, 1988.
504			_aIncludes bibliographical references (p. [41]-43).
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aRandomization 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.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aRandom number generators.
650		0	_aComputational complexity.
655		0	_aElectronic books.
710	2		_aIEEE Xplore (Online Service), _edistributor.
710	2		_aMIT Press, _epublisher.
776	0	8	_iPrint version _z9780262640527
830		0	_aACM distinguished dissertations
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267312
999			_c39227 _d39227