Danh mục

Ebook Complexity of Algorithms - Peter Gacs

Số trang: 180      Loại file: pdf      Dung lượng: 811.29 KB      Lượt xem: 21      Lượt tải: 0    
tailieu_vip

Xem trước 10 trang đầu tiên của tài liệu này:

Thông tin tài liệu:

Ebook "Complexity of Algorithms" contains 14 chapters, includes: Chapter 0 introduction and preliminaries, chapter 1 models of computation, chapter 2 algorithmic decidability, chapter 3 computation with resource bounds, chapter 4 general theorems on space and time complexity, chapter 5 non-deterministic algorithms, chapter 6 randomized algorithms, chapter 7 information complexity: the complexity-theoretic notion of randomness, chapter 8 pseudo-random numbers, chapter 9 parallel algorithms, chapter 10 decision trees, chapter 11 communication complexity, chapter 12 the complexity of algebraic computations, chapter 13 circuit complexity, chapter 14 an application of complexity: cryptography.
Nội dung trích xuất từ tài liệu:
Ebook Complexity of Algorithms - Peter Gacs

Tài liệu được xem nhiều: