|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
in00005631836 |
| 003 |
OCoLC |
| 005 |
20220616160308.0 |
| 008 |
100513t20102010riua b 001 0 eng |
| 010 |
|
|
|a 2010018152
|
| 016 |
7 |
|
|a 015658372
|2 Uk
|
| 020 |
|
|
|a 9780821851920 (alk. paper)
|
| 020 |
|
|
|a 0821851926 (alk. paper)
|
| 035 |
|
|
|a (OCoLC)615339073
|
| 040 |
|
|
|a DLC
|b eng
|c DLC
|d YDX
|d YDXCP
|d CDX
|d UKMGB
|d SFB
|d MUU
|d OCLCF
|d S3O
|d EEM
|d UtOrBLW
|
| 049 |
|
|
|a EEMR
|
| 050 |
0 |
0 |
|a QA267.7
|b .G654 2010
|
| 082 |
0 |
0 |
|a 004.01/51
|2 22
|
| 100 |
1 |
|
|a Goldreich, Oded.
|0 http://id.loc.gov/authorities/names/n98097979
|
| 245 |
1 |
2 |
|a A primer on pseudorandom generators /
|c Oded Goldreich.
|
| 260 |
|
|
|a Providence, R.I. :
|b American Mathematical Society,
|c [2010], ©2010.
|
| 300 |
|
|
|a x, 114 pages :
|b illustrations ;
|c 26 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|
| 490 |
1 |
|
|a University lecture series ;
|v v. 55
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
0 |
|
|a Chapter 1. Introduction -- Chapter 2. General-purpose pseudorandom generators -- Chapter 3. Derandomization of time-complexity classes -- Chapter 4. Space-bounded distinguishers -- Chapter 5. Special purpose generators -- Concluding remarks -- Appendix A. Hashing functions -- Appendix B. On randomness extractors -- Appendix C. A generic hard-core predicate -- Appendix D. Using randomness in computation -- Appendix E. Cryptographic applications of pseudorandom functions -- Appendix F. Some basic complexity classes.
|
| 520 |
|
|
|a A 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 |
|
|
|a This 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 |
|
|
|a The 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 |
|a Computational complexity.
|0 http://id.loc.gov/authorities/subjects/sh85029473
|
| 650 |
|
0 |
|a Random number generators.
|0 http://id.loc.gov/authorities/subjects/sh85111351
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|0 http://id.loc.gov/authorities/subjects/sh85042295
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 (OCoLC)fst00871991
|
| 650 |
|
7 |
|a Computer science
|x Mathematics.
|2 fast
|0 (OCoLC)fst00872460
|
| 650 |
|
7 |
|a Random number generators.
|2 fast
|0 (OCoLC)fst01089807
|
| 650 |
|
7 |
|a Datavetenskap.
|2 sao
|
| 830 |
|
0 |
|a University lecture series (Providence, R.I.) ;
|v 55.
|0 http://id.loc.gov/authorities/names/n88540797
|
| 907 |
|
|
|y .b121577326
|b 170816
|c 170213
|
| 998 |
|
|
|a rs
|b 170213
|c m
|d a
|e -
|f eng
|g riu
|h 2
|i 2
|
| 994 |
|
|
|a C0
|b EEM
|
| 999 |
f |
f |
|i ade41024-af23-5af0-828a-e12ead013351
|s 40584c3e-f7f8-56a5-9bef-46af97afa3ec
|t 0
|
| 952 |
f |
f |
|p Can Circulate
|a Michigan State University-Library of Michigan
|b Michigan State University
|c MSU Remote Storage
|d MSU Remote Storage
|t 0
|e QA267.7 .G654 2010
|h Library of Congress classification
|i Printed Material
|m 31293035334329
|n 1
|
