89,00 €*
Versandkostenfrei per Post / DHL
Aktuell nicht verfügbar
"This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics."--Richard M. Murray, California Institute of Technology
"The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems."--Ali Jadbabaie, University of Pennsylvania
"The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future."--Vincent Blondel, Université catholique de Louvain
"This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics."--Richard M. Murray, California Institute of Technology
"The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems."--Ali Jadbabaie, University of Pennsylvania
"The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future."--Vincent Blondel, Université catholique de Louvain
| Erscheinungsjahr: | 2009 |
|---|---|
| Fachbereich: | Technik allgemein |
| Genre: | Importe, Technik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: | Gebunden |
| ISBN-13: | 9780691141954 |
| ISBN-10: | 0691141959 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: |
Bullo, Francesco
Cortés, Jorge Martínez, Sonia |
| Hersteller: | Princeton University Press |
| Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
| Maße: | 263 x 184 x 29 mm |
| Von/Mit: | Francesco Bullo (u. a.) |
| Erscheinungsdatum: | 26.07.2009 |
| Gewicht: | 0,863 kg |
| Erscheinungsjahr: | 2009 |
|---|---|
| Fachbereich: | Technik allgemein |
| Genre: | Importe, Technik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: | Gebunden |
| ISBN-13: | 9780691141954 |
| ISBN-10: | 0691141959 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: |
Bullo, Francesco
Cortés, Jorge Martínez, Sonia |
| Hersteller: | Princeton University Press |
| Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
| Maße: | 263 x 184 x 29 mm |
| Von/Mit: | Francesco Bullo (u. a.) |
| Erscheinungsdatum: | 26.07.2009 |
| Gewicht: | 0,863 kg |
Ähnliche Produkte
Lieferzeit 2-4 Werktage
Lieferzeit 2-4 Werktage
Lieferzeit 2-3 Wochen
Lieferzeit 2-4 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
