Parameterized Complexity by Downey Rodney (28 results)

Condition: 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.

Hardcover. Condition: Very Good+. Dust Jacket Condition: No Dust Jacket As Issued. Text clean and tight; no dust jacket; Monographs In Computer Science; 8vo 8" - 9" tall; 548 pages.

Condition: New. pp. 763.

Condition: 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.

Paperback. Condition: Brand New. reprint edition. 763 pages. 9.25x6.25x2.00 inches. In Stock.

Condition: New. pp. 796.

Condition: New. In English.

Condition: New.

Condition: New. In English.

Condition: New.

Taschenbuch. Condition: Neu. Parameterized Complexity | Rodney G. Downey (u. a.) | Taschenbuch | Monographs in Computer Science | xv | Englisch | 2012 | Springer | EAN 9781461267980 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condition: As New. Unread book in perfect condition.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.…

Paperback. Condition: Brand New. reprint edition. 548 pages. 9.25x6.10x1.40 inches. In Stock.

Condition: new. Questo è un articolo print on demand.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents an accessible overview of the state of the art of multivariate algorithmics and complexityDescribes the wealth of recent techniques for proving parameterized tractabilityShowcases the powerful new lower bound techniques.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Features: describes many of the standard algorithmic techniques available for establishing parametric tractability; reviews the classical hardness classes; explores the various limitations and relaxations of the methods; showcases the powerful new lower bound techniques; examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach; demonstrates how complexity methods and ideas have evolved over the past 25 years.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 796 pp. Englisch.…

Condition: New. Print on Demand pp. 763.

Condition: New. PRINT ON DEMAND pp. 763.

Condition: new. Questo è un articolo print on demand.

Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Features: describes many of the standard algorithmic techniques available for establishing parametric tractability; reviews the classical hardness classes; explores the various limitations and relaxations of the methods; showcases the powerful new lower bound techniques; examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach; demonstrates how complexity methods and ideas have evolved over the past 25 years.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 796 pp. Englisch.…

Condition: new. Questo è un articolo print on demand.

Condition: New. Print on Demand pp. 796 83 Illus.

Condition: New. PRINT ON DEMAND pp. 796.

Condition: 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 .…

Gebunden. Condition: 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 .…

Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 556 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 552 pp. Englisch.…