Inbunden, Engelska, 2013
Del i serien Monographs in Theoretical Computer Science. An EATCS Series
Fault-Tolerant Search Algorithms
Reliable Computation with Unreliable Information
739 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format
Beskrivning
Produktinformation
- Utgivningsdatum: 2013-12-16
- Mått: 155 x 235 x 18 mm
- Vikt: 454 g
- Format: Inbunden
- Språk: Engelska
- Serie: Monographs in Theoretical Computer Science. An EATCS Series
- Antal sidor: 207
- Upplaga: 2013
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN: 9783642173264
Utforska kategorier
Mer information
The author received the award for the Best Italian Ph.D. thesis in Theoretical Computer Science, for work in this field, and he has since been awarded the Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and the German Federal Ministry of Research.
Recensioner i media
From the book reviews: "The book is well-written and well-organized, and provides a rigorous and up-to-date account of a wide area of algorithmic fault-tolerant search. Each chapter is supplemented with useful bibliographical notes and exercises. ... This book will be useful to students and researchers in many diverse areas, ranging from combinatorial search, to learning and coding theory. It is a most valuable addition to the EATCS Series 'Monographs in Theoretical Computer Science'." (Daniele Mundici, zbMATH, Vol. 1295, 2014)
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.