bokomslag Discrete Algebraic Methods
739:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 354 sidor
  • 2016
The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents: Algebraic structures Cryptography Number theoretic algorithms Polynomial time primality test Elliptic curves Combinatorics on words Automata Discrete infinite groups
  • Författare: Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf
  • Illustratör: 90 Schwarz-Weiß-Abbildungen
  • Format: Pocket/Paperback
  • ISBN: 9783110413328
  • Språk: Engelska
  • Antal sidor: 354
  • Utgivningsdatum: 2016-05-24
  • Förlag: De Gruyter