Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 84,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: California Books, Miami, FL, U.S.A.
EUR 86,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press CUP, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Majestic Books, Hounslow, Regno Unito
EUR 84,23
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 91,27
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 83,37
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 83,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 83,65
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 91,67
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 118,70
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 515 pages. 9.50x6.25x1.25 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 104,77
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 153,83
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2019. Hardcover. . . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 98,66
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields.
Lingua: Inglese
Editore: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 178,09
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2019. Hardcover. . . . . .
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields. This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and meta-theorems, and demonstrates methods through extensive examples using a single data set. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Da: Revaluation Books, Exeter, Regno Unito
EUR 79,71
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 515 pages. 9.50x6.25x1.25 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Da: CitiRetail, Stevenage, Regno Unito
EUR 90,47
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: new. Hardcover. Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields. This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and meta-theorems, and demonstrates methods through extensive examples using a single data set. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Da: moluna, Greven, Germania
EUR 87,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and .