Articles liés à Computational and Algorithmic Problems in Finite Fields
Synopsis
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 Theory and Algebraic Curves. 6. Elliptic Curves. 7. Recurrent Sequences in Finite Fields and Linear Cyclic Codes. 8. Finite Fields and Discreate Mathematics. 9. Congruences. 10. Some Related Problems. Appendix 1. Appendix 2. Appendix 3. Addendum. References. Index.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurKluwer Academic Publishers
- Date d'édition1992
- ISBN 10 0792320573
- ISBN 13 9780792320579
- ReliureRelié
- Langueanglais
- Nombre de pages256
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 111,07
EUR 4,73 expédition depuis Royaume-Uni vers France
Destinations, frais et délais
Résultats de recherche pour Computational and Algorithmic Problems in Finite Fields
Image d'archives
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Edité par
Springer, 1992
ISBN 10 : 0792320573
ISBN 13 : 9780792320579
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur Z1-A-019-01908
Quantité disponible : 1 disponible(s)
Image d'archives
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780792320579_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computational and Algorithmic Problems in Finite Fields
Edité par
Springer Netherlands, 1992
ISBN 10 : 0792320573
ISBN 13 : 9780792320579
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Gebunden. Etat : 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 . N° de réf. du vendeur 898695608
Quantité disponible : Plus de 20 disponibles
Image d'archives
Computational and Algorithmic Problems in Finite Fields
Edité par
Kluwer Academic Publishers, 1992
ISBN 10 : 0792320573
ISBN 13 : 9780792320579
Neuf
Couverture rigide
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 568. N° de réf. du vendeur C9780792320579
Quantité disponible : Plus de 20 disponibles
Image d'archives
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Edité par
Kluwer Academic Pub, 1993
ISBN 10 : 0792320573
ISBN 13 : 9780792320579
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 1st edition. 256 pages. 10.00x6.75x0.75 inches. In Stock. N° de réf. du vendeur x-0792320573
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Computational and Algorithmic Problems in Finite Fields
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780792320579
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Computational and Algorithmic Problems in Finite Fields
Edité par
SPRINGER NATURE Nov 1992, 1992
ISBN 10 : 0792320573
ISBN 13 : 9780792320579
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780792320579
Quantité disponible : 2 disponible(s)