Skip to content

Noisy Information and Computational Complexity

Spend $50 to get a free movie!

ISBN-10: 0521553687

ISBN-13: 9780521553681

Edition: 1996

Authors: Leszek Plaskota

List price: $135.99
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


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…    
Customers also bought

Book details

List price: $135.99
Copyright year: 1996
Publisher: Cambridge University Press
Publication date: 5/16/1996
Binding: Hardcover
Pages: 324
Size: 6.50" wide x 9.50" long x 0.75" tall
Weight: 1.232
Language: English

Worst case setting
Average case setting
Worst-average case setting
Average-worst case setting
Asymptotic setting