| نوع مدرک: | متون چاپی | | سرشناسه | Sherine ، Anli، نویسنده | | شماره بازیابی : | QA267.7 .S53 2023 | | عنوان : | Algorithm and design complexity | | تکرار نام مولف : | Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander | | ویرایش : | First edition | | صفحه شمار: | pages cm | | شابک/شاپا | 978-1-03-240932-0 | | یادداشت | Includes bibliographical references | | شناسه افزوده : | Jasmine ، Mary Peter, Geno Albert Alexander, S | | موضوعها : | اصفا
Computational complexity ؛ Computer algorithms
| | چکیده : | "Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time space trade-off, symptotic notations and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide and conquer, dynamic programming, and backtracking. Features: Includes complete coverage of basics and design of algorithms. Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics. Provides time and space complexity tutorials. Reviews combinatorial optimization of Knapsack problem. Simplifies recurrence relation for time complexity. This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering"-- | | مندرجات | Algorithm analysis -- Divide and conquer -- Dynamic programming -- Backtracking -- Graph | | لینک ثابت رکورد: | ../opac/index.php?lvl=record_display&id=7613 | | زبان مدرک : | English |
|  |
QA20.C65 
