大葉大學圖書館 |

Design and analysis of algorithms[electronic resource] :a contemporary perspective /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	005.1
書名/作者:	Design and analysis of algorithms : a contemporary perspective // Sandeep Sen, Amit Kumar.
作者:	Sen, Sandeep.
其他作者:	Kumar, Amit.
出版者:	Cambridge : : Cambridge University Press,, 2019.
面頁冊數:	xxvi, 367 p. : : ill., digital ;; 24 cm.
附註:	Title from publisher's bibliographic system (viewed on 02 May 2019).
標題:	Algorithms.
ISBN:	9781108654937
ISBN:	9781108496827
ISBN:	9781108721998
摘要、提要註:	The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
電子資源:	https://doi.org/10.1017/9781108654937

Design and analysis of algorithms[electronic resource] :a contemporary perspective /
Sen, Sandeep.

Design and analysis of algorithmsa contemporary perspective /[electronic resource] :Sandeep Sen, Amit Kumar. - Cambridge :Cambridge University Press,2019. - xxvi, 367 p. :ill., digital ;24 cm.

Title from publisher's bibliographic system (viewed on 02 May 2019).

The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.

ISBN: 9781108654937Subjects--Topical Terms:

182797
Algorithms.

LC Class. No.: QA9.58 / .S454 2019

Dewey Class. No.: 005.1

Design and analysis of algorithms[electronic resource] :a contemporary perspective /
LDR:01628nmm a2200253 a 4500 001 522838
003 UkCbUP
005 20190503093533.0
006 m d
007 cr nn 008maaau
008 230416s2019 enk o 1 0 eng d
020 $a 9781108654937 $q (electronic bk.)
020 $a 9781108496827 $q (hardback)
020 $a 9781108721998 $q (paperback)
035 $a CR9781108654937
040 $a UkCbUP $b eng $c UkCbUP $d GP
050 0 0 $a QA9.58 $b .S454 2019
082 0 0 $a 005.1 $2 23
090 $a QA9.58 $b .S474 2019
100 1 $a Sen, Sandeep. $3 748214
245 1 0 $a Design and analysis of algorithms $h [electronic resource] : $b a contemporary perspective / $c Sandeep Sen, Amit Kumar.
260 $a Cambridge : $b Cambridge University Press, $c 2019.
300 $a xxvi, 367 p. : $b ill., digital ; $c 24 cm.
500 $a Title from publisher's bibliographic system (viewed on 02 May 2019).
520 $a The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
650 0 $a Algorithms. $3 182797
700 1 $a Kumar, Amit. $3 602163
856 4 0 $u https://doi.org/10.1017/9781108654937