Muutke küpsiste eelistusi

E-raamat: Computational Number Theory

(RCCIIT, Kolkata, India)
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 136,50 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Raamatukogudele
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"Preface This book is a result of my teaching a Masters-level course with the same name for five years in the Indian Institute of Technology Kharagpur. The course was attended mostly by MTech and final-year BTech students from the department of Computer Science and Engineering. Students from the department of Mathematics and other engineering departments (mostly Electronics and Electrical Engineering, and Information Technology) also attended the course. Some research students enrolled in the MS and PhD programs constituted the third section of the student population. Historically, therefore, the material presented in this book is tuned to cater to the need and taste of engineering students in advanced undergraduate and beginning graduate levels. However, several topics that could not be covered in a one-semester course have also been included in order to make this book a comprehensive and complete treatment of number-theoretic algorithms. A justification is perhaps due to the effect why another textbookon computational number theory was necessary. Some (perhaps not many) textbooks on this subject are already available to international students. These books vary widely with respect to their coverage and technical sophistication. I believe that a textbook specifically targeted towards the engineering population is somewhat missing. This book should be accessible (but is not restricted) to students who have not attended any course on number theory. My teaching experience shows that heavy use of algebra (particularly, advanced topics like commutative algebra or algebraic number theory) often demotivates students"--

Arvustused

"This book would be a good choice for cryptography and engineering students wanting to learn the basics of algorithmic number theory." Mathematical Reviews, November 2014

Arithmetic of Integers. Arithmetic of Finite Fields. Arithmetic of Polynomials. Arithmetic of Elliptic Curves. Primality Testing. Integer Factorization. Discrete Logarithms. Large Sparse Linear Systems. Public-Key Cryptography. Appendices. Index.

Abhijit Das is an associate professor in the Department of Computer Science and Engineering at the Indian Institute of Technology, Kharagpur. His research interests are in the areas of arithmetic and algebraic computations with specific applications to cryptology.