Computer Science,Algorithms and Complexity
by: Adele Kuzmiakova
Publisher finelybook 出版社: Arcler Press (November 1,2020)
Language 语言: English
Print length 页数: 254 pages
ISBN-10: 1774077485
ISBN-13: 9781774077481
The book defines complexity as a numerical function T (n)-the relationship between time and input size n,as one of the basic ideas of computer science. The computational complexity is categorized by: algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues,the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described such as graph and network algorithms,algebraic algorithms,parallel algorithms and randomized algorithms.
Computer Science,Algorithms and Complexity
相关推荐
- Design and Analysis of Algorithms: A Contemporary Perspective
- Deep Learning for Autonomous Vehicle Control: Algorithms, State-of-the-Art, and Future Prospects
- Data Science and Predictive Analytics: Biomedical and Health Applications using R 2nd Edition
- Data Visualization with Python for Beginners: Visualize Your Data using Pandas, Matplotlib and Seaborn
finelybook
