Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 55,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 57,68
Cantidad disponible: 8 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: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 57,68
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: ALLBOOKS1, Direk, SA, Australia
EUR 65,10
Cantidad disponible: 8 disponibles
Añadir al carritoBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 64,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 68,14
Cantidad disponible: 2 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 59,11
Cantidad disponible: 2 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 69,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 55,39
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 73,34
Cantidad 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.
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 59,93
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 62,32
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback / softback. Condición: New. New copy - Usually dispatched within 4 working days.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 62,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 62,99
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Original o primera edición
EUR 71,61
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2023. 1st Edition. Paperback. . . . . .
Librería: Revaluation Books, Exeter, Reino Unido
EUR 75,79
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.com USA, London, LONDO, Reino Unido
EUR 92,88
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: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 87,15
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2023. 1st Edition. Paperback. . . . . . Books ship from the US and Ireland.
Librería: moluna, Greven, Alemania
EUR 68,59
Cantidad 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: Revaluation Books, Exeter, Reino Unido
EUR 101,90
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 822 pages. 10.00x7.00x1.85 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 60,60
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Algorithm Design | A Methodological Approach - 150 problems and detailed solutions | Patrick Bosc (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2023 | Chapman and Hall/CRC | EAN 9781032369396 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
Idioma: Inglés
Publicado por Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 107,35
Cantidad 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: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 141,03
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 143,73
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 146,04
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 148,54
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 141,11
Cantidad 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 149,17
Cantidad disponible: 1 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days. 209.
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 87,71
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 149,15
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.