Techniques for Designing and Analyzing Algorithms - Couverture souple

Stinson, Douglas R.

 
9781032024103: Techniques for Designing and Analyzing Algorithms

Synopsis

This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l?auteur

Douglas R. Stinson obtained his PhD in Combinatorics and Optimization from the University of Waterloo in 1981. He held academic positions at the University of Manitoba and the University of Nebraska-Lincoln before returning to Waterloo in 1998. In 2019, Dr. Stinson retired from the David R. Cheriton School of Computer Science at the University of Waterloo and he now holds the title Professor Emeritus. His research interests include cryptography and computer security, combinatorics and coding theory, and applications of discrete mathematics in computer science. He was elected as a Fellow of the Royal Society of Canada in 2011. He has published almost 400 papers and several books, including Cryptography: Theory and Practice, Fourth Edition, also published by CRC Press.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Autres éditions populaires du même titre

9780367228897: Techniques for Designing and Analyzing Algorithms

Edition présentée

ISBN 10 :  0367228890 ISBN 13 :  9780367228897
Editeur : Routledge, 2021
Couverture rigide