Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lekh Raj Vermani | - |
| dc.date.accessioned | 2024-03-20T03:54:46Z | - |
| dc.date.available | 2024-03-20T03:54:46Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.uri | http://thuvienso.thanglong.edu.vn//handle/TLU/9610 | - |
| dc.description.abstract | This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology. | vi |
| dc.language.iso | en | vi |
| dc.subject | Algorithms | Thuật toán | vi |
| dc.title | An elementary approach to design and analysis of algorithms | vi |
| dc.type | Sách/Book | vi |
| Appears in Collections | Toán học | |
Files in This Item:
