000 03652cam a2200553Ii 4500
001 9780429486326
003 FlBoTFG
005 20220711212746.0
006 m o d
007 cr cnu---unuuu
008 190803s2020 flu ob 001 0 eng d
040 _aOCoLC-P
_beng
_erda
_epn
_cOCoLC-P
020 _z9780429942631
020 _z042994263X
020 _a9780429486326
_qelectronic book
020 _a0429486324
_qelectronic book
020 _z9780429942624
_qelectronic book ;
_qEPUB
020 _z0429942621
_qelectronic book ;
_qEPUB
020 _z9780429942617
_qelectronic book ;
_qMobipocket
020 _z0429942613
_qelectronic book ;
_qMobipocket
035 _a(OCoLC)1111514860
035 _a(OCoLC-P)1111514860
050 4 _aQA39.3
_b.S7275 2020
050 4 _aQA76.9.M35
072 7 _aMAT
_x000000
_2bisacsh
072 7 _aMAT
_x003000
_2bisacsh
072 7 _aMAT
_x036000
_2bisacsh
072 7 _aPB
_2bicssc
082 0 4 _a511/.1
_223
082 0 4 _a004.01/51
_223
100 1 _aSridharan, Sriraman,
_eauthor.
_919423
245 1 0 _aDiscrete mathematics :
_bgraph algorithms, algebraic structures, coding theory, and cryptography /
_cSriraman Sridharan, R. Balakrishnan.
264 1 _aBoca Raton :
_bCRC Press, Taylor & Francis Group,
_c[2020]
300 _a1 online resource (341 pages)
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
520 _aConveying 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 to individuals 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 given positive 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.
588 _aOCLC-licensed vendor bibliographic record.
650 7 _aMATHEMATICS
_xGeneral.
_2bisacsh
_94635
650 7 _aMATHEMATICS
_xApplied.
_2bisacsh
_95811
650 7 _aMATHEMATICS
_xCombinatorics.
_2bisacsh
_96898
650 0 _aMathematics
_vTextbooks.
_919424
650 0 _aComputer science
_xMathematics.
_93866
700 1 _aBalakrishnan, R.
_q(Rangaswami),
_eauthor.
_919425
856 4 0 _3Taylor & Francis
_uhttps://www.taylorfrancis.com/books/e/9780429486326
856 4 2 _3OCLC metadata license agreement
_uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
942 _cEBK
999 _c72095
_d72095