TRA CỨU
Thư mục - Vốn tư liệu
Introduction to algorithms

Introduction to algorithms

 The MIT- Press , c2009 ISBN: 9780262033848
 Massachusetts : xix,1291 p. : ill. ; 23 cm. English
Mô tả biểu ghi
ID:50025
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
Môn học Công nghệ thông tin
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
Tệp tin điện tử http://lib.hanu.vn/kiposdata1/bookcover/tailieumonhoc/000123075thumbimage.jpg
MARC
Hiển thị đầy đủ trường & trường con
TagGiá trị
00000000cam a2200000 a 4500
00150025
00220
00460777
005202203071112
008170629s2009 mau eng
0091 0
020[ ] |a 9780262033848
020[ ] |a 9780262533058
035[ ] |a 1456369559
035[# #] |a 1083195631
039[ ] |a 20241125203018 |b idtocn |c 20220307111252 |d huongnt |y 20170629101935 |z khiembt
041[0 ] |a eng
044[ ] |a mau
082[0 4] |a 005.1 |b INT
245[1 0] |a Introduction to algorithms / |c Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
260[ ] |a Massachusetts : |b The MIT- Press , |c c2009
300[ ] |a xix,1291 p. : |b ill. ; |c 23 cm.
500[ ] |a Includesbibliographical references and index.
520[ ] |a 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
650[0 0] |a Computer programming
650[0 0] |a Computer algorithms
650[0 0] |a Data processing
650[0 0] |a Algorithms
653[0 ] |a Chương trình máy tính
653[0 ] |a Xử lí dữ liệu
653[0 ] |a Giải thuật
690[ ] |a Công nghệ thông tin
691[ ] |a Công nghệ thông tin
691[ ] |a Công nghệ thông tin chất lượng cao
692[ ] |a Cấu trúc dữ liệu và giải thuật
692[ ] |a Cấu trúc dữ liệu và giải thuật
692[ ] |a FIT5DSA
693[ ] |a Tài liệu tham khảo
700[1 ] |a Cormen, Thomas H.
700[1 ] |a Leiserson, Charles Eric.
700[1 ] |a Rivest, Ronald L.
700[1 ] |a Stein, Clifford.
852[ ] |a 100 |b TK_Tài liệu môn học-MH |c 516015 |j (2): 000101592, 000123075
856[1 ] |u http://lib.hanu.vn/kiposdata1/bookcover/tailieumonhoc/000123075thumbimage.jpg
890[ ] |a 2 |c 3 |b 0 |d 7
Dòng Mã vạch Bản sao Nơi lưu Tình trạng Cho phép yêu cầu
1 000123075 2 TK_Tài liệu môn học-MH Tài liệu chỉ đọc tại Thư viện
#1 000123075
Nơi lưu TK_Tài liệu môn học-MH
Tình trạng Tài liệu chỉ đọc tại Thư viện
2 000101592 1 TK_Tài liệu môn học-MH Tài liệu chỉ đọc tại Thư viện
#2 000101592
Nơi lưu TK_Tài liệu môn học-MH
Tình trạng Tài liệu chỉ đọc tại Thư viện
Tài liệu số
3