Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 32,63
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Fine.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 62,51
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 60,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: SMASS Sellers, IRVING, TX, Estados Unidos de America
EUR 66,64
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 68,12
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 58,99
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Chapman and Hall/CRC 2023-01-31, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Chiron Media, Wallingford, Reino Unido
EUR 64,27
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 69,25
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 67,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Rarewaves USA, OSWEGO, IL, Estados Unidos de America
EUR 88,65
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 50,07
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 101,51
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Librería: moluna, Greven, Alemania
EUR 72,39
Cantidad disponible: 2 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, C.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 109,05
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 822 pages. 10.00x7.00x1.85 inches. In Stock.
Idioma: Inglés
Publicado por Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Rarewaves USA United, OSWEGO, IL, Estados Unidos de America
EUR 91,63
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 153,05
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 154,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 170,43
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 165,04
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Rarewaves.com UK, London, Reino Unido
EUR 95,99
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 155,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 177,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 202,21
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 199,09
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 220,85
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 822 pages. 10.00x7.00x1.69 inches. In Stock.
EUR 41,60
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Très bon. Merci, votre achat aide à financer des programmes de lutte contre l'illettrisme.
Idioma: Francés
Publicado por Bod Third Party Titles, 2021
ISBN 10: 2416001035 ISBN 13: 9782416001031
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 51,34
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 81,18
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 822 pages. 10.00x7.00x1.85 inches. In Stock. This item is printed on demand.
Librería: moluna, Greven, Alemania
EUR 129,93
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, C.