Synopsis
Mathematical Induction.- Growth of Functions.- Recurrence Relations.- Algorithm Analysis.- Basic Data Structure.- Hash.- Tree.- Search.- Sorting.- Divide and Conquer.- Dynamic Programming.- Greedy Algorithms.- Graph.- Backtracking Algorithms.- P, NP, NP-Complete, and NP-Hard Problems.
À propos de l?auteur
Dr. Habib Izadkhah is an associate professor at the Department of Computer Science, University of Tabriz, Iran. He worked in the industry for a decade as a software engineer before becoming an academic. His research interests include algorithms and graphs, software engineering, and bioinformatics. More recently, he has been working on developing and applying deep learning to a variety of problems, dealing with biomedical images, speech recognition, text understanding, and generative models. He has contributed to various research projects, authored a number of research papers in international conferences, workshops, and journals, and also has written five books, including Source Code Modularization: Theory and Techniques from Springer and Deep Learning in Bioinformatics from Elsevier.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.