Contact
How to shop
Delivery
Shopping guide
Computational and Algorithmic Problems in Finite Fields
English
297 b
30-day return policy
Customers also purchased
/
Paperback
4 234
Ft
/
Paperback
11 430
Ft
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
7 418
Ft
/
Hardback
59 474
Ft
/
Hardback
54 520
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?