Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 51,56
Convertir monedaCantidad 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: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 62,23
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback / softback. Condición: New. New copy - Usually dispatched within 4 working days. 209.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 66,29
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 55,38
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 51,56
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Original o primera edición
EUR 73,93
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2023. 1st Edition. Paperback. . . . . .
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 53,78
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 64,29
Convertir monedaCantidad 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 64,93
Convertir monedaCantidad 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 68,67
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: moluna, Greven, Alemania
EUR 68,59
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondició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: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 88,79
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2023. 1st Edition. Paperback. . . . . . Books ship from the US and Ireland.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 102,17
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 822 pages. 10.00x7.00x1.85 inches. In Stock.
Publicado por Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Idioma: Inglés
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
EUR 72,94
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. 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. A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Publicado por Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 108,73
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. 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. A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 149,28
Convertir monedaCantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 143,57
Convertir monedaCantidad 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 144,01
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 160,79
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days. 209.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 167,09
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 154,78
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 158,09
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 170,63
Convertir monedaCantidad disponible: 3 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Librería: Buchpark, Maidenhead, Berkshire, Reino Unido
EUR 110,57
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. Condition: Very Good, Pages: 808, Size: 0x0x0.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 179,03
Convertir monedaCantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 204,41
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 822 pages. 10.00x7.00x1.69 inches. In Stock.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 74,80
Convertir monedaCantidad 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 72,28
Convertir monedaCantidad disponible: 1 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: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 83,77
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 71,73
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.