• 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

Hardcover

Series: Texts in Theoretical Computer Science. an Eatcs

FictionGeneral Computers

ISBN10: 3540299521
ISBN13: 9783540299523
Publisher: Springer Nature
Published: Feb 9 2006
Pages: 495
Weight: 2.15
Height: 1.20 Width: 6.30 Depth: 9.40
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