Artículos relacionados a Parameterized Complexity (Monographs in Computer Science)
Sinopsis
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 223,97
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Parameterized Complexity (Monographs in Computer Science)
Imagen de archivo
Parameterized Complexity
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9780387948836. Nº de ref. del artículo: 5568937
Cantidad disponible: 1 disponibles
Imagen de archivo
Parameterized Complexity
Publicado por
Springer-Verlag, 1997
ISBN 10: 038794883X
ISBN 13: 9780387948836
Antiguo o usado
Tapa dura
Librería: Moe's Books, Berkeley, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hard cover. Condición: Very good. No jacket. Great condition. Spine edges are bumped. Binding is tight. Inside is clean and unmarked. Nº de ref. del artículo: 1153903
Cantidad disponible: 1 disponibles
Imagen de archivo
Parameterized Complexity
Librería: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Very Good+. Text clean and tight; no dust jacket; Monographs In Computer Science; 8vo 8" - 9" tall; 548 pages. Nº de ref. del artículo: 228080
Cantidad disponible: 1 disponibles
Imagen de archivo
Parameterized Complexity
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:9780387948836. Nº de ref. del artículo: 9981951
Cantidad disponible: 1 disponibles
Imagen del vendedor
Parameterized Complexity
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability Downey considers problems in terms of parameterized languages and taking k-slices of the language, giving readers insight into . Nº de ref. del artículo: 5912242
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Parameterized Complexity (Monographs in Computer Science)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780387948836_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Complexity
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 671826-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Complexity
Publicado por
Springer New York Nov 1998, 1998
ISBN 10: 038794883X
ISBN 13: 9780387948836
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful techniques. The intractability theory seemed to have a deep structure and techniques all of its own. 556 pp. Englisch. Nº de ref. del artículo: 9780387948836
Cantidad disponible: 2 disponibles
Imagen del vendedor
Parameterized Complexity
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 671826-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Complexity
Publicado por
Springer New York, Springer US, 1998
ISBN 10: 038794883X
ISBN 13: 9780387948836
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful techniques. The intractability theory seemed to have a deep structure and techniques all of its own. Nº de ref. del artículo: 9780387948836
Cantidad disponible: 1 disponibles