Lectures on Proof Verification and Approximation Algorithms -
-40% koodiga BOOKS
Saadetis 12-18 tööpäeva jooksul
30-päevane tagastamisõigus
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabi ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
Lisateave
| Kirjastaja | Springer Berlin Heidelberg |
|---|---|
| Series | Lecture Notes in Computer Science |
| Väljalaskeaasta | 1998 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9783540642015 |