CSDL sách

Trở về
.jpg
  • The art of computer programming : volume 4 : introduction to combinatorial algorithms and boolean functions, fascicle 0
  • Tác giả: Donald E. Knuth
  • Nhà xuất bản: Addison - Wesley - Boston
  • Năm xuất bản: 2010
  • Số trang:216 p.
  • Kích thước:24 cm
  • Số đăng ký cá biệt:20801
  • ISBN:978-0-321-53496-5
  • Mã Dewey:005.1
  • Đơn giá:0
  • Vị trí lưu trữ:03 Quang Trung
  • Ngôn ngữ:English
  • Loại tài liệu:Sách Chuyên ngành
  • Đang rỗi/ Tổng sách:1/1
  • Từ khóa:Computer programming; Computer algorithms
  • Chủ đề: Computer--Programming & Computer algorithms
  • Chuyên ngành: Khoa Công Nghệ Thông Tin
  • Tóm tắt: This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation.
Sách cùng chuyên ngành
Sách cùng chủ đề