Hertrampf ulrich (39 Ergebnisse)

Zustand: New.

Paperback. Zustand: New. 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 structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups.…

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New. 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 structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups.…

Zustand: New.

Zustand: New.

Paperback. Zustand: New. This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information. Almost all assertions are shown with full proofs. Exercises are provided, with solutions presented in full detail.…

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New. This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information. Almost all assertions are shown with full proofs. Exercises are provided, with solutions presented in full detail.…

Zustand: New. pp. 352.

Zustand: New. 1st edition NO-PA16APR2015-KAP.

Paperback. Zustand: Brand New. illustrated edition. 342 pages. 9.25x6.75x0.75 inches. In Stock.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. pp. 352.

Zustand: New.

Zustand: New. 2016. Paperback. . . . . .

Zustand: New. In English.

Paperback. Zustand: New. 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 structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups.…

Zustand: New. 2016. Paperback. . . . . . Books ship from the US and Ireland.

Paperback. Zustand: New. This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information. Almost all assertions are shown with full proofs. Exercises are provided, with solutions presented in full detail.…

Paperback. Zustand: Brand New. 280 pages. 9.45x6.69x0.67 inches. In Stock.

Zustand: New. 2023. Paperback. . . . . .

Paperback. Zustand: New. Volker Diekert, Manfred Kufleitner, Ulrich Hertrampf, University of Stuttgart Gerhard Rosenberger, University of Hamburg, Germany.This book treats the elements of discrete ma.

Paperback. Zustand: New. 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 structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups.…

Zustand: New. In English.

Zustand: New. 2023. Paperback. . . . . . Books ship from the US and Ireland.