Marknadens största urval
Snabb leverans

Computational Number Theory

Om Computational Number Theory

Developed from the author¿s popular graduate-level course, this self-contained text presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra and requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. With an emphasis on implementation issues, it uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781439866153
  • Format:
  • Inbunden
  • Sidor:
  • 614
  • Utgiven:
  • 18. mars 2013
  • Mått:
  • 236x161x32 mm.
  • Vikt:
  • 962 g.
Leveranstid: 2-4 veckor
Förväntad leverans: 6. december 2024

Beskrivning av Computational Number Theory

Developed from the author¿s popular graduate-level course, this self-contained text presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra and requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. With an emphasis on implementation issues, it uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.

Användarnas betyg av Computational Number Theory



Hitta liknande böcker
Boken Computational Number Theory finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.