Shparlinski igor (174 resultados)

hardcover. Condición: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.…

Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Hardcover. Condición: Like New. Square Tight Binding.Clean interior, save for small p/o signature to top of front paste down, else new.

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

XII, 398 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2227. Sprache: Englisch. …

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condición: New.

Condición: New.

Hardback or Cased Book. Condición: New. Number Theoretic Methods in Cryptography: Complexity Lower Bounds. Book.

Condición: New.

Hardcover. Condición: Gut. 378 S. Ex-library with stamp and library-signature in good condition, some traces of use. C-01879 9783764365103 Sprache: Englisch Gewicht in Gramm: 1150.

Condición: As New. Unread book in perfect condition.

Karton Karton. Condición: Sehr gut. 180 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: 460.…

Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

PF. Condición: New.

PF. Condición: New.

Condición: New. In English.

Condición: New. In English.

Condición: New. In English.

Condición: New. In English.

Condición: New. pp. 256.

Condición: New. pp. 198.

Condición: New. Introduces techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. This work contains a number of open problems and proposals for further research. Series: Progress in Computer Science and Applied Logic. Num Pages: 182 pages, biography. BIC Classification: GPJ; PBH; URY; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 12. Weight in Grams: 454. . 1999. Hardback. . . . .…

Condición: New. pp. 196.

Condición: New.

Condición: New. pp. 394.

Paperback. Condición: Brand New. reprint edition. 252 pages. 9.40x6.20x0.70 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of - polynomials; - algebraic functions; - Boolean functions; - linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.…