Availability: In Stock

Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography – eBook

SKU: discrete-mathematics-graph-algorithms-algebraic-structures-coding-theory-and-cryptography-ebook

Original price was: $66.10.Current price is: $11.00.

eBook details

  • Authors: Sriraman Sridharan, R. Balakrishnan
  • File Size: 11 MB, 10 MB
  • Format: ePub, PDF
  • Length: 340 pages
  • Publisher: Chapman and Hall/CRC
  • Publication Date: July 30, 2019
  • Language: English
  • ASIN: B07VT8ZZQM
  • ISBN-10: 0815347391, 0429486324, 0429942621
  • ISBN-13: 9780815347392, 9780429486326, 9780429942624
Hurry up! Sale ends in:
Days
Hrs
Mins
Secs

Description

Unlock the world of Applied Algebra with our comprehensive guide, Discrete Mathematics in (PDF/ePub) format. This meticulously crafted textbook serves as an essential resource for senior undergraduates and novice graduate students engaged in the fields of computer science and mathematics. It’s also an invaluable tool for anyone eager to deepen their understanding of diverse mathematical concepts.

In this engaging volume, readers will explore a vast array of topics that are foundational to the study of discrete mathematics. Here’s a sneak peek at what you’ll discover:

  • Kickstarting your journey with an insightful introduction to linear codes, including a detailed look at cyclic codes.
  • Diving into the core algebraic structures encompassing groups, rings, matrices, and fields, including an extensive examination of finite fields. Additionally, this section covers vector spaces, linear equations, and their solutions, paving the way for a robust mathematical framework.
  • Enjoy an in-depth discussion on crucial graph algorithms, featuring Kruskal’s algorithm and Prim’s algorithm for minimal spanning trees in weighted graphs. You’ll also delve into Floyd’s algorithm, Warshall’s algorithm, Dijkstra’s single-source shortest path algorithm, and Kuhn-Munkres Algorithm, alongside both BFS and DFS searches. Detailed applications of BFS and DFS are also provided, enhancing practical understanding.

Furthermore, the book provides a thorough explanation of private key cryptosystems and delves into public-key cryptosystems such as ElGamal, RSA, and Miller-Rabin. For the first time in an academic textbook, we introduce the revolutionary Agrawal-Kayal-Saxena algorithm (AKS Algorithm), which tests the primality of a positive integer in polynomial time.

Two standout features of this ebook enhance the learning experience:

  • Comprehensive solutions to all even-numbered exercises across all chapters, ensuring readers can verify their understanding and progress.
  • A wealth of illustrative examples throughout the ebook, designed to solidify key concepts and provide clarity.

NOTE: This sale exclusively offers the ebook Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography in both PDF and ePub formats. Please be advised that access codes are not included.

Whether you’re stepping into the arena of advanced mathematics or reinforcing your current knowledge, this ebook is your key to mastering the intricacies of discrete mathematics, making it a must-have addition to your academic tools. Grab your copy today!

Reviews

There are no reviews yet.

Be the first to review “Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography – eBook”

You may also like…