Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 60,24
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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.
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 68,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 63,91
Quantità: 2 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 58,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 66,81
Quantità: 1 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Chapman and Hall/CRC 2023-01-31, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Chiron Media, Wallingford, Regno Unito
EUR 64,14
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 69,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 67,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 75,42
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New. 2023. 1st Edition. Paperback. . . . . .
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condizione: 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.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 101,64
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Condizione: New. 2023. 1st Edition. Paperback. . . . . . Books ship from the US and Ireland.
Da: WeBuyBooks, Rossendale, LANCS, Regno Unito
EUR 98,43
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Da: moluna, Greven, Germania
EUR 72,39
Quantità: 2 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 108,35
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 822 pages. 10.00x7.00x1.85 inches. In Stock.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
Paperback. Condizione: 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.
Da: preigu, Osnabrück, Germania
EUR 63,10
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 154,24
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Taylor & Francis Ltd, London, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 134,50
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 155,48
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 154,32
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 170,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Majestic Books, Hounslow, Regno Unito
EUR 165,25
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2023
ISBN 10: 1032369396 ISBN 13: 9781032369396
Da: Rarewaves.com UK, London, Regno Unito
EUR 95,80
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.