Computer Science, Algorithms and Complexity
Adele Kuzmiakova
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.
درجه (قاطیغوری(:
کال:
2020
خپرندویه اداره:
Arcler Press
ژبه:
english
صفحه:
254
ISBN 10:
1774077485
ISBN 13:
9781774077481
فایل:
PDF, 6.06 MB
IPFS:
,
english, 2020