Go back

Computational And Algorithmic Problems In Finite Fields(1st Edition)

Authors:

Igor Shparlinski

Free computational and algorithmic problems in finite fields 1st edition igor shparlinski 9401047960,
8 ratings
Cover Type:Hardcover
Condition:Used

In Stock

Include with your book

Free shipping: April 06, 2024
Access to 3 Million+ solutions Free
Ask 10 Questions from expert 200,000+ Expert answers
7 days-trial

Total Price:

$0

List Price: $54.99 Savings: $54.99(100%)

Book details

ISBN: 9401047960, 978-9401047968

Book publisher: Springer

Get your hands on the best-selling book Computational And Algorithmic Problems In Finite Fields 1st Edition for free. Feed your curiosity and let your imagination soar with the best stories coming out to you without hefty price tags. Browse SolutionInn to discover a treasure trove of fiction and non-fiction books where every page leads the reader to an undiscovered world. Start your literary adventure right away and also enjoy free shipping of these complimentary books to your door.

Computational And Algorithmic Problems In Finite Fields 1st Edition Summary: 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.