Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Corriere Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Noisy Information and Computational Complexity

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

Leszek Plaskota

Lingua

Inglese

Libro In brossura

Codice Libristo: 02028179

Casa editrice Cambridge University Press, marzo 2012

In this volume, which was originally published in 1996, noisy information is studied in the context... Descrizione completa

Codice Libristo: 02028179

159 b

65.09 €

Magazzino esterno Inviamo tra 9-15 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

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

In brossura

34.49 €

Hokusai - Livre avec 8 posters détachables collegium

In brossura

8.19 €

Sophrologie Richard Esposito

Adobe ePub DRM

19.39 €

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

In brossura

5.79 €

Pražské metro Pavel Karous

Libro

51.39 €

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.