This book has been designed in a user-friendly style for a course in Applied Algebra. It covers topics such as basic algebraic structures, graph algorithms, coding theory, and cryptography. It is suitable for senior undergraduates and beginning graduate students in computer science and mathematics, as well as for individuals who want to gain knowledge in these areas.
The book provides an introduction to linear codes, including cyclic codes. It also offers an excellent introduction to basic algebraic structures such as groups, rings, matrices, fields, finite fields, vector spaces, linear equations, and their solutions. Additionally, it delivers a complete discussion of several graph algorithms such as Kruskal’s algorithm, Prim’s algorithm, Floyd’s algorithm, Warshall’s algorithm, Dijkstra’s single-source shortest path algorithm, and Kuhn-Munkres algorithm. The book also discusses several applications of breadth-first search (BFS) and depth-first search (DFS).
Furthermore, the book presents a description of private key cryptosystems and a discussion on public-key cryptosystems such as ElGamal, RSA, and Miller-Rabin. It also features the Agrawal-Kayal-Saxena algorithm (AKS Algorithm) for testing if a positive integer is prime or not in polynomial time. This algorithm is presented for the first time in a textbook.
The book includes replies to all even-numbered exercises in all the chapters and illustrative examples throughout the ebook to help readers appreciate the concepts described.
Please note that the sale only includes the ebook Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography in PDF and in ePub format. Access codes are not included.
Reviews
There are no reviews yet.