Fundamentals of Parameterized Complexity

Fundamentals of Parameterized Complexity - Texts in Computer Science

2013

Hardback (17 Dec 2013)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

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.

Book information

ISBN: 9781447155584
Publisher: Springer London
Imprint: Springer
Pub date:
Edition: 2013
DEWEY: 005.1
DEWEY edition: 23
Language: English
Number of pages: xxx, 763
Weight: 1352g
Height: 239mm
Width: 162mm
Spine width: 56mm