Skip to main content
Cart 0
Computational and Algorithmic Problems in Finite Fields
Click to zoom

Share this book

Computational and Algorithmic Problems in Finite Fields

Book Details

Format Hardback
ISBN-10 0792320573
ISBN-13 9780792320579
Publisher Kluwer Academic Publishers
Imprint Kluwer Academic Publishers
Country of Manufacture GB
Country of Publication GB
Publication Date Nov 30th, 1992
Print length 256 Pages
Weight 538 grams
Dimensions 23.40 x 15.60 x 1.70 cms
Product Classification: AlgebraNumber theory
KSh 15,050.00
Currently unavailable 0 in stock

Delivery Location

Delivery fee: Select location

Secure
Quality
Fast
A treatment of computation and algorithms for finite fields. The book covers such topics as polynomial factorization, distribution of primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and applications of finite fields to areas of mathematics.
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.

Get Computational and Algorithmic Problems in Finite Fields by Igor E. Shparlinski at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Kluwer Academic Publishers and it has 256 pages.

Shopping Cart

Africa largest book store

Sub Total: