Let us wish you a happy birthday!
Date of Birth
Please fill in a complete birthday Enter a valid birthday
×
Parameterized Complexity Theory by J. Flum, M. Grohe - Paperback
493.50 AED

Parameterized Complexity Theory by J. Flum, M. Grohe - Paperback

Be the first to rate this product 

493.50 AED 

  - You Save -493.50 AED
All prices include VAT  Details
FREE Shipping Details
Category Type
Information Technology
ISBN
9783642067570
Author
J. Flum, M. Grohe
Publisher
Springer
Description:

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, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.

This book is a state-of-the-art introduction to both ...

Ships From United States
Ship to Dubai (Change city)
Delivered within Saturday, Jun 2 - Monday, Jun 4 to Dubai

Condition:
New
Sold by:
InternationalBookStore (88% Positive Rating)

PRODUCT INFORMATION

  •  

    Specifications

    Category Type
    Information Technology
    ISBN
    9783642067570
    Languages
    English
    Item EAN
    2724437187407
    People
    Author
    J. Flum, M. Grohe
    Category Type
    Information Technology
    ISBN
    9783642067570
    Languages
    English
    Item EAN
    2724437187407
    People
    Author
    J. Flum, M. Grohe
    People
    Publisher
    Springer
    Technical Information
    Binding
    Paperback
    Languages and countries
    Book Language
    English
    Read more
  •  

    Description:

    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, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a

    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, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.

    This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter 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 fixed-parameter tractable algorithms, and bounded fixed-parameter 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.

    Product Features:
    • Category: Information Technology
    • Binding: Paperback
    • Language of Text: English
    • Author(s): J. Flum, M. Grohe
    • Publisher: Springer
    • ISBN: 9783642067570
    • Number of Pages: 495
    • Dimensions: 9.21 x 6.14 x 1.03 inches
 

Customer Reviews

0
No ratings yet
Be the first to rate this product
Rate this product:

Sponsored products for you

×

Please verify your mobile number to complete your checkout

We will send you an SMS containing a verification code. Please double check your mobile number and click on "Send Verification Code".

+ Edit