Millions of books in English, Spanish and other languages. Free UK delivery 

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography
Type
Physical Book
Year
2019
Language
English
Pages
340
Format
Hardcover
ISBN13
9780815347392
Edition No.
1

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

Sriraman Sridharan; R. Balakrishnan (Author) · · Hardcover

Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography - Sriraman Sridharan; R. Balakrishnan

Physical Book

£ 99.00

£ 110.00

You save: £ 11.00

10% discount
  • Condition: New
It will be shipped from our warehouse between Wednesday, July 17 and Monday, July 22.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.

Synopsis "Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews