ISBN: 9780821851920 - a primer on pseudorandom generators (16 risultati)

Softcover. Condizione: Gut. x, 114 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04942 9780821851920 Sprache: Englisch Gewicht in Gramm: 550.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. 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. 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 several natural notions of special-purpose pseudorandom generators. 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.…

Condizione: New.

Paperback. Condizione: Brand New. 113 pages. 10.00x7.25x0.50 inches. In Stock.

kartoniert kartoniert. Condizione: Sehr gut. 114 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 248.…

Condizione: As New. Unread book in perfect condition.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Condizione: New. Series: University Lecture Series. Num Pages: Illustrations. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 254 x 181 x 8. Weight in Grams: 252. . 2010. Paperback. . . . . Books ship from the US and Ireland.

Condizione: New. Surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators. The primer assumes basic familiarity with the notion of efficient algorith.

Condizione: New. Series: University Lecture Series. Num Pages: Illustrations. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 254 x 181 x 8. Weight in Grams: 252. . 2010. Paperback. . . . .

Taschenbuch. Condizione: Neu. Neuware - Surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators. 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.…

Paperback. Condizione: New. 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. 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 several natural notions of special-purpose pseudorandom generators. 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.…