Computational Algorithmic Problems Finite by Shparlinski Igor (26 results)

Condition: New. In.

PF. Condition: New.

Condition: New. pp. 256.

Condition: 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.

Condition: 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.

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

Condition: As New. Unread book in perfect condition.

Condition: New. In.

Taschenbuch. Condition: Neu. Computational and Algorithmic Problems in Finite Fields | Igor Shparlinski | Taschenbuch | xii | Englisch | 2012 | Springer | EAN 9789401047968 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 'Et moi, . si j'avait su comment en revenir. je One service mathematics bas rendemI !be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics . '; 'One service logic has rendered computer science . '; 'One service category theory has rendered mathematics . .'. All arguably true. And all statements obtainable this way fonn pan of the raison d' 8tre of this series.

Condition: New.

Condition: New.

Hardback. Condition: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other areas of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Brand New. 1st edition. 256 pages. 10.00x6.75x0.75 inches. In Stock.

Gebunden. Condition: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive .

Hardback. Condition: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other areas of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Condition: new. Questo è un articolo print on demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'Et moi, . si j'avait su comment en revenir. je One service mathematics bas rendemI !be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics . '; 'One service logic has rendered computer science . '; 'One service category theory has rendered mathematics . .'. All arguably true. And all statements obtainable this way fonn pan of the raison d' 8tre of this series. 256 pp. Englisch.

Condition: New. Print on Demand pp. 256 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 256.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Series Editor s Preface. Preface. Notations. Introduction. 1. Polynomial Factorization. 2. Finding Irreducible and Primitive Polynomials. 3. The Distribution of Irreducible and Primitive Polynomials. 4. Bases and Computation in Finite Fields. 5. Coding .

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -1. Polynomial Factorization.- 1. Univariate factorization.- 2. Multivariate factorization.- 3. Other polynomial decompositions.- 2. Finding irreducible and primitive polynomials.- 1. Construction of irreducible polynomials.- 2. Construction of primitive polynomials.- 3. The distribution of irreducible and primitive polynomials.- 1. Distribution of irreducible and primitive polynomials.- 2. Irreducible and primitive polynomials of a given height and weight.- 3. Sparse polynomials.- 4. Applications to algebraic number fields.- 4. Bases and computation in finite fields.- 1. Construction of some special bases for finite fields.- 2. Discrete logarithm and Zech's logarithm.- 3. Polynomial multiplication and multiplicative complexity in finite fields.- 4. Other algorithms in finite fields.- 5. Coding theory and algebraic curves.- 1. Codes and points on algebraic curves.- 2. Codes and exponential sums.- 3. Codes and lattice packings and coverings.- 6. Elliptic curves.- 1. Some general properties.- 2. Distribution of primitive points on elliptic curves.- 7. Recurrent sequences in finite fields and leyelic linear codes.- 1. Distribution of values of recurrent sequences.- 2. Applications of recurrent sequences.- 3. Cyclic codes and recurrent sequences.- 8. Finite fields and discrete mathematics.- 1. Cryptography and permutation polynomials.- 2. Graph theory, combinatorics, Boolean functions.- 3. Enumeration problems in finite fields.- 9. Congruences.- 1. Optimal coefficients and pseudo-random numbers.- 2. Residues of exponential functions.- 3. Modular arithmetic.- 4. Other applications.- 10. Some related problems.- 1. Integer factorization, primality testing and the greatest common divisor.- 2. Computational algebraic number theory.- 3. Algebraic complexity theory.- 4.Polynomials with integer coefficients.- Appendix 1.- Appendix 2.- Appendix 3.- Addendum.- References.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 256 pp. Englisch.

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields. 256 pp. Englisch.