 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Noisy Information and Computational Complexity by Leszek Plaskota ISBN-10: 9780521553681 ISBN-10: 0-521-55368-7 ISBN-13: 9780521553681 ISBN-13: 978-0-521-55368-1 Hardcover 1996-07-30 Cambridge University Press Find Lowest Price |
Editorials | ||
Product Description This book deals with the computational complexity of mathematical problems for which available information is partial, noisy and priced. The author develops a general theory of computational complexity of continuous problems with noisy information and gives a number of applications; he considers deterministic as well as stochastic noise. He also presents optimal algorithms, optimal information, and complexity bounds in different settings: worst case, average case, mixed worst-average, average-worst, and asymptotic. Particular topics include: the existence of optimal linear (affine) algorithms, optimality properties of smoothing spline, regularization and least squares algorithms (with the optimal choice of the smoothing and regularization parameters), adaption versus nonadaption, and relations between different settings. The book integrates the work of researchers over the past decade in such areas as computational complexity, approximation theory, and statistics, and includes many new results as well. The author supplies two hundred exercises to increase the reader's understanding of the subject. | ||
Book Description This is the first book dealing with the computational complexity of mathematical problems for which available information is partial, noisy and priced. It is organised to be used either as a textbook for advanced courses, or as a standard reference for professional computer scientists, statisticians, applied mathematicians, engineers, control theorists and economists. | ||