Noisy information and computational complexity / Leszek Plaskota.
Plaskota, Leszek| Call Number | 003/.54 |
| Author | Plaskota, Leszek, author. |
| Title | Noisy information and computational complexity / Leszek Plaskota. Noisy Information & Computational Complexity |
| Physical Description | 1 online resource (xi, 308 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Summary | 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. |
| Subject | COMPUTATIONAL COMPLEXITY. |
| Multimedia |
Total Ratings:
0
02323nam a22003618i 4500
001
vtls001584724
003
VRT
005
20200921122100.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s1996||||enk o ||1 0|eng|d
020
$a 9780511600814 (ebook)
020
$z 9780521553681 (hardback)
020
$z 9780521349444 (paperback)
035
$a (UkCbUP)CR9780511600814
039
9
$y 202009211221 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA267.7 $b .P57 1996
082
0
0
$a 003/.54 $2 20
100
1
$a Plaskota, Leszek, $e author.
245
1
0
$a Noisy information and computational complexity / $c Leszek Plaskota.
246
3
$a Noisy Information & Computational Complexity
264
1
$a Cambridge : $b Cambridge University Press, $c 1996.
300
$a 1 online resource (xi, 308 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520
$a 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.
650
0
$a COMPUTATIONAL COMPLEXITY.
776
0
8
$i Print version: $z 9780521553681
856
4
0
$u https://doi.org/10.1017/CBO9780511600814
999
$a VIRTUA
No Reviews to Display
| Summary | 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. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Subject | COMPUTATIONAL COMPLEXITY. |
| Multimedia |