Description
The Encyclopedia of Algorithms is a comprehensive collection of algorithmic solutions to important problems in computer science, written and reviewed by leading experts in the field. Edited by Ming-Yang Kao, the work contains hundreds of alphabetically arranged entries, each of which provides a detailed examination of an algorithmic problem and its optimal solutions.
The second edition of this encyclopedia, with the addition of over 450 new entries, covers emerging fields such as bioinformatics, social networks, and modern machine learning. This book is recognized as an essential tool for researchers and graduate students seeking quick and accurate access to the latest algorithmic achievements in various scientific and industrial fields.
Book Features
- Extensive coverage of over 630 alphabetical entries focusing on critical algorithmic issues.
- Thorough review of all content by experts and references to reputable scientific literature.
- Provide links to downloadable code, experimental results, and related datasets.
- Exploring applications in diverse fields including encryption, data compression, and artificial intelligence.
- User-friendly structure with cross-references for quick search of specialized information.
Book specifications
- Publisher: SpringerReference
- Instructor/Author: Ming-Yang Kao
- Number of pages: 2428
- Format: PDF
Pictures
User Guide
Extract the file and run it with the appropriate software.
Download link
File(s) password: www.downloadly.ir
File size
34.5 MB
