MARC Record from marc_columbia

LEADER: 02754cam a2200385 a 4500
001 10081967
005 20210331133808.0
008 101104s2010 riua b 001 0 eng
010 $a 2010018152
035 $a(OCoLC)ocn615339073
040 $aDLC$beng$cDLC$dYDX$dYDXCP$dCDX$dUKMGB$dSFB$dMUU$dOCLCF$dS3O
016 7 $a015658372$2Uk
020 $a9780821851920 (alk. paper)
020 $a0821851926 (alk. paper)
035 $a(OCoLC)615339073
050 00 $aQA267.7$b.G654 2010
082 00 $a004.01/51$222
049 $aZCUA
100 1 $aGoldreich, Oded.
245 12 $aA primer on pseudorandom generators /$cOded Goldreich.
260 $aProvidence, R.I. :$bAmerican Mathematical Society,$cc2010.
300 $ax, 114 p. :$bill. ;$c26 cm.
490 1 $aUniversity lecture series ;$vv. 55
504 $aIncludes bibliographical references and index.
520 $aA fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography.
520 $aThis primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and serveral natural notions of special-purpose pseudorandom generators.
520 $aThe primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used. as a result, the primer is essentially self-contained, although the interested reader is at times referred to other sources for more detail. --Book Jacket.
650 0 $aComputational complexity.
650 0 $aRandom number generators.
650 0 $aComputer science$xMathematics.
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aComputer science$xMathematics.$2fast$0(OCoLC)fst00872460
650 7 $aRandom number generators.$2fast$0(OCoLC)fst01089807
830 0 $aUniversity lecture series (Providence, R.I.) ;$v55.
852 00 $bmat$hQA267.7$i.G654 2010g