DDC 005.1
Nhan đề Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Thông tin xuất bản Massachusetts : The MIT- Press , c2009
Mô tả vật lý xix,1291 p. : ill. ; 23 cm.
Phụ chú Includesbibliographical references and index.
Tóm tắt Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called Divide-and-Conquer). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition
Thuật ngữ chủ đề Computer programming
Thuật ngữ chủ đề Computer algorithms
Thuật ngữ chủ đề Data processing
Thuật ngữ chủ đề Algorithms
Từ khóa tự do Chương trình máy tính
Từ khóa tự do Xử lí dữ liệu
Từ khóa tự do Giải thuật
Khoa Công nghệ thông tin
Chuyên ngành Công nghệ thông tin
Chuyên ngành Công nghệ thông tin chất lượng cao
Môn học Cấu trúc dữ liệu và giải thuật
Môn học Cấu trúc dữ liệu và giải thuật
Môn học FIT5DSA
Tác giả(bs) CN Cormen, Thomas H.
Tác giả(bs) CN Leiserson, Charles Eric.
Tác giả(bs) CN Rivest, Ronald L.
Tác giả(bs) CN Stein, Clifford.
Địa chỉ 100TK_Tài liệu môn học-MH516015(2): 000101592, 000123075
000 00000cam a2200000 a 4500
00150025
00220
00460777
005202203071112
008170629s2009 mau eng
0091 0
020|a9780262033848
020|a9780262533058
035##|a1083195631
039|a20220307111252|bhuongnt|c20220301092802|dtult|y20170629101935|zkhiembt
0410 |aeng
044|amau
08204|a005.1|bINT
24510|aIntroduction to algorithms /|cThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
260|aMassachusetts :|bThe MIT- Press ,|cc2009
300|axix,1291 p. :|bill. ;|c23 cm.
500|aIncludesbibliographical references and index.
520|aSome books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called Divide-and-Conquer). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition
65000|aComputer programming
65000|aComputer algorithms
65000|aData processing
65000|aAlgorithms
6530 |aChương trình máy tính
6530 |aXử lí dữ liệu
6530 |aGiải thuật
690|aCông nghệ thông tin
691|aCông nghệ thông tin
691|aCông nghệ thông tin chất lượng cao
692|aCấu trúc dữ liệu và giải thuật
692|aCấu trúc dữ liệu và giải thuật
692|aFIT5DSA
693|aTài liệu tham khảo
7001 |aCormen, Thomas H.
7001 |aLeiserson, Charles Eric.
7001 |aRivest, Ronald L.
7001 |aStein, Clifford.
852|a100|bTK_Tài liệu môn học-MH|c516015|j(2): 000101592, 000123075
8561|uhttp://lib.hanu.vn/kiposdata1/bookcover/tailieumonhoc/000123075thumbimage.jpg
890|a2|c3|b0|d4
Dòng Mã vạch Vị trí Giá sách Ký hiệu PL/XG Phân loại Bản sao Tình trạng Thành phần
1 000101592 TK_Tài liệu môn học-MH MH CNTT 005.1 INT Tài liệu Môn học 1 Tài liệu chỉ đọc tại Thư viện Bản sao
2 000123075 TK_Tài liệu môn học-MH MH CNTT 005.1 INT Tài liệu Môn học 2 Tài liệu chỉ đọc tại Thư viện