000 03047nam a2200433Ma 4500
001 00012298
003 WSP
007 cr |nu|||unuuu
008 210720s2021 si ob 001 0 eng d
010 _a 2021012980
040 _aWSPC
_beng
_cWSPC
020 _a9789811237591
_q(ebook)
020 _a981123759X
_q(ebook)
020 _z9789811237584
_q(hbk.)
020 _z9811237581
_q(hbk.)
020 _z9789811238529
_q(pbk.)
020 _z9811238529
_q(pbk.)
035 _a(OCoLC)1260665594
050 0 0 _aQA9.58
_b.K54 2021
072 7 _aCOM
_x051300
_2bisacsh
072 7 _aCOM
_x051230
_2bisacsh
082 0 0 _a518/.1
_223
049 _aMAIN
100 1 _aKlein, Shmuel T.
_93964
245 1 0 _aBasic concepts in algorithms
_h[electronic resource] /
_cShmuel Tomi Klein, Bar Ilan University, Israel.
260 _aSingapore :
_bWorld Scientific,
_c[2021]
300 _a1 online resource (364 p.).
504 _aIncludes bibliographical references and index.
505 0 _aList of background concepts -- List of algorithms Preface Recursion. Divide and conquer -- Dynamic programming -- Graph algorithms. Minimum spanning trees -- Shortest paths -- Probabilistic algorithms. Primality -- Text algorithms. Data compression -- Pattern matching -- Numerical algorithms. Fast fourier transform Cryptography Intractability. NP completeness Approximations -- Solutions to selected exercises References Index.
520 _a"This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second year undergraduate students in study fields related to computers and programming."
520 _a"Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended."--
_cPublisher's website.
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat reader.
650 0 _aAlgorithms.
_93390
650 7 _aAlgorithms.
_2fast
_0(OCoLC)fst00805020
_93390
655 0 _aElectronic books.
_93294
856 4 0 _uhttps://www.worldscientific.com/worldscibooks/10.1142/12298#t=toc
_zAccess to full text is restricted to subscribers.
942 _cEBK
999 _c72567
_d72567