Foundations of algorithms
Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To su...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | पुस्तक |
| भाषा: | Undetermined |
| प्रकाशित: |
Sudbury, Mass.
Jones and Bartlett Publishers
2011
|
| विषय: | |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 01184nam a2200193Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_194834 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 082 | |a 518.1 | ||
| 082 | |b N353 | ||
| 100 | |a Neapolitan, Richard E. | ||
| 245 | 0 | |a Foundations of algorithms | |
| 245 | 0 | |c Richard Neapoltian and Kumarss Naimipour | |
| 260 | |a Sudbury, Mass. | ||
| 260 | |b Jones and Bartlett Publishers | ||
| 260 | |c 2011 | ||
| 520 | |a Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts. | ||
| 650 | |a Algorithms,Thuật toán | ||
| 910 | |a Hải | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||