Von dem Buch Lectures on Proof Verification and Approximation Algorithms haben wir 2 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger: Lectures on Proof Verification and Approximation Algorithms (ISBN: 9783540697015) in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
71%: Ernst W. Mayr; Hans-Jürgen Prömel; Angelika Steger: Lectures on Proof Verification and Approximation Algorithms (ISBN: 9783540642015) Erstausgabe, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
Lectures on Proof Verification and Approximation Algorithms
13 Angebote vergleichen
| Preise | 2018 | 2019 | 2020 |
|---|---|---|---|
| Schnitt | € 46,05 | € 45,87 | € 44,42 |
| Nachfrage |
1
Symbolbild
Lectures on Proof Verification and Approximation Algorithms (Lecture Notes in Computer Science) (2008)
~EN PB USISBN: 9783540642015 bzw. 3540642013, vermutlich in Englisch, Springer, Taschenbuch, gebraucht, guter Zustand.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: CHE.
Von Händler/Antiquariat, Buyback Express.
Springer, 2008-06-13. Paperback. Very Good. 0.8000 in x 9.4400 in x 6.3200 in. Very Good Condition. Light, reasonable wear. Clean and mark-free inside and out!
Von Händler/Antiquariat, Buyback Express.
Springer, 2008-06-13. Paperback. Very Good. 0.8000 in x 9.4400 in x 6.3200 in. Very Good Condition. Light, reasonable wear. Clean and mark-free inside and out!
2
Lectures on Proof Verification and Approximation Algorithms (1998)
~EN PB NWISBN: 9783540642015 bzw. 3540642013, vermutlich in Englisch, Springer Berlin, Taschenbuch, neu.
Lieferung aus: Deutschland, Lieferbar in 2 - 3 Tage.
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. Taschenbuch, 25.02.1998.
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. Taschenbuch, 25.02.1998.
3
Lectures on Proof Verification and Approximation Algorithms
~EN PB NWISBN: 9783540642015 bzw. 3540642013, vermutlich in Englisch, Springer Shop, Taschenbuch, neu.
Lieferung aus: Schweiz, Lagernd.
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. Soft cover.
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. Soft cover.
4
Lectures on Proof Verification and Approximation Algorithms
~EN NW EB DLISBN: 9783540697015 bzw. 3540697012, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
Lieferung aus: Italien, Lagernd, zzgl. Versandkosten.
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. eBook.
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. eBook.
5
Lectures on Proof Verification and Approximation Algorithms
EN NW EB DLISBN: 9783540697015 bzw. 3540697012, in Englisch, Springer, Berlin/Heidelberg, Deutschland, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
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.
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.
6
Lectures on Proof Verification and Approximation Algorithms
~EN NW EB DLISBN: 9783540697015 bzw. 3540697012, vermutlich in Englisch, Springer Berlin Heidelberg, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Lectures on Proof Verification and Approximation Algorithms: 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. Englisch, Ebook.
Lectures on Proof Verification and Approximation Algorithms: 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. Englisch, Ebook.
7
Lectures on Proof Verification and Approximation Algorithms (1998)
DE NW RPISBN: 9783540642015 bzw. 3540642013, in Deutsch, Bertrams Print On Demand, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
AHA-BUCH GmbH, [4009276].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
AHA-BUCH GmbH, [4009276].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
8
Lectures on Proof Verification and Approximation Algorithms (Lecture Notes in Computer Science)
DE PB NWISBN: 9783540642015 bzw. 3540642013, in Deutsch, Springer, Taschenbuch, neu.
Von Händler/Antiquariat, ExtremelyReliable [8304062], Richmond, TX, U.S.A.
Buy with confidence. Excellent Customer Service & Return policy.
Buy with confidence. Excellent Customer Service & Return policy.
9
Lectures on Proof Verification Approximation Algorithms (Lecture Notes in Computer Science) (2008)
DE USISBN: 9783540642015 bzw. 3540642013, in Deutsch, Springer, gebraucht.
getbooks GmbH, [4040832].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
10
Lectures on Proof Verification Approximation Algorithms (Lecture Notes in Computer Science 1367) (2008)
DE USISBN: 9783540642015 bzw. 3540642013, in Deutsch, Springer, gebraucht.
Petra Gros, [3076014].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…