Parameterized Complexity Theory /
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2006.
|
| Series: | Texts in Theoretical Computer Science. An EATCS Series.
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |