Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Noisy Information and Computational Complexity

Name: Noisy Information and Computational Complexity
Brand: Cambridge University Press
SKU: 02028179
Price: 62.91 EUR
Availability: InStock
Author: Leszek Plaskota
ISBN: 9780521349444

Leszek Plaskota

Език

Английски език

Книга С меки корици

Код Либристо: 02028179

Издателство Cambridge University Press, март 2012

In this volume, which was originally published in 1996, noisy information is studied in the context... Цялото описание

Код Либристо: 02028179

152 b

62.91 €

123.05 лв

Външен склад Изпращаме след 9-15 дни

До 30 дни за връщане на стоки

Клиентите са закупили също

L'Impact de la Volatilite Des Taux de Change Sur Le Commerce Salah-H

С меки корици

34.86 € 68.19 лв

Hokusai - Livre avec 8 posters détachables collegium

С меки корици

8.21 € 16.05 лв

Sophrologie Richard Esposito

Adobe ePub DRM

19.52 € 38.18 лв

Klíčkův notýsek - hudební výchova - hudební nauka (Pracovní učebnice pro PHV a I. stupeň ZŠ) Eva Šašinková

С меки корици

5.88 € 11.51 лв

Pražské metro Pavel Karous

Книга

51.96 € 101.63 лв

In this volume, which was originally published in 1996, noisy information is studied in the context of computational complexity; in other words the text deals with the computational complexity of mathematical problems for which 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; deterministic as well as stochastic noise is considered. He presents optimal algorithms, optimal information, and complexity bounds in different settings: worst case, average case, mixed worst-average and average-worst, and asymptotic. The book integrates the work of researchers in such areas as computational complexity, approximation theory and statistics, and includes many fresh results as well. About two hundred exercises are supplied with a view to increasing the reader's understanding of the subject. The text will be of interest to professional computer scientists, statisticians, applied mathematicians, engineers, control theorists, and economists.