Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series),Used

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series),Used

In Stock
SKU: DADAX3642067573
Brand: Springer
Condition: New
Regular price$105.28
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixedparameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.This book is a stateoftheart introduction to both algorithmic techniques for fixedparameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixedparameter tractable algorithms, and bounded fixedparameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed