Loading…
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...
Saved in:
Main Author: | |
---|---|
Corporate Author: | |
Other Authors: | |
Format: | eBook |
Language: | English |
Published: |
Berlin :
Springer,
©2006.
Berlin : [2006] |
Series: | Texts in theoretical computer science.
|
Physical Description: |
1 online resource (xiii, 493 pages) : illustrations. |
Subjects: | |
Online Access: | SpringerLink - Click here for access |
Copy 1 | CMU Electronic Access | Available |
---|