Compartir
Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography (en Inglés)
Sriraman Sridharan; R. Balakrishnan (Autor)
·
· Tapa Dura
Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography (en Inglés) - Sriraman Sridharan; R. Balakrishnan
S/ 368,56
S/ 737,11
Ahorras: S/ 368,56
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Jueves 25 de Julio y el
Martes 06 de Agosto.
Lo recibirás en cualquier lugar de Perú entre 2 y 5 días hábiles luego del envío.
Reseña del libro "Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography (en Inglés)"
Conveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra. The book covers graph algorithms, basic algebraic structures, coding theory and cryptography. It will be most suited for senior undergraduates and beginning graduate students in mathematics and computer science as also toindividuals who want to have a knowledge of the below-mentioned topics. Provides a complete discussion on several graph algorithms such as Prims algorithm and Kruskals algorithm for sending a minimum cost spanning tree in a weighted graph, Dijkstras single source shortest path algorithm, Floyds algorithm, Warshalls algorithm, Kuhn-Munkres Algorithm. In addition to DFS and BFS search, several applications of DFS and BFS are also discussed. Presents a good introduction to the basic algebraic structures, namely, matrices, groups, rings, fields including finite fields as also a discussion on vector spaces and linear equations and their solutions. Provides an introduction to linear codes including cyclic codes. Presents a description of private key cryptosystems as also a discussion on public key cryptosystems such as RSA, ElGamal and Miller-Rabin. Finally, the Agrawal-KayalSaxena algorithm (AKS Algorithm) for testing if a givenpositive integer is prime or not in polynomial time is presented- the first time in a textbook. Two distinguished features of the book are: Illustrative examples have been presented throughout the book to make the readers appreciate the concepts described. Answers to all even-numbered exercises in all the chapters are given.
