• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Parameterized Complexity Theory

Parameterized Complexity Theory

Paperback

Series: Texts in Theoretical Computer Science. an Eatcs

FictionGeneral Computers

ISBN10: 3642067573
ISBN13: 9783642067570
Publisher: Springer Nature
Published: Feb 12 2010
Pages: 495
Weight: 1.56
Height: 1.03 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Computers