Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Elements of the General Theory of Optimal Algorithms (Hardcover, 1st ed. 2021)
Loot Price: R3,639
Discovery Miles 36 390
|
|
Elements of the General Theory of Optimal Algorithms (Hardcover, 1st ed. 2021)
Series: Springer Optimization and Its Applications, 188
Expected to ship within 12 - 17 working days
|
In this monograph, the authors develop a methodology that allows
one to construct and substantiate optimal and suboptimal algorithms
to solve problems in computational and applied mathematics.
Throughout the book, the authors explore well-known and proposed
algorithms with a view toward analyzing their quality and the range
of their efficiency. The concept of the approach taken is based on
several theories (of computations, of optimal algorithms, of
interpolation, interlination, and interflatation of functions, to
name several). Theoretical principles and practical aspects of
testing the quality of algorithms and applied software, are a major
component of the exposition. The computer technology in
construction of T-efficient algorithms for computing -solutions to
problems of computational and applied mathematics, is also
explored. The readership for this monograph is aimed at scientists,
postgraduate students, advanced students, and specialists dealing
with issues of developing algorithmic and software support for the
solution of problems of computational and applied mathematics.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.