Parameterized complexity /
This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language. In doing so, the reader is introduced to new cla...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
New York :
Springer,
[1999]
|
| Series: | Monographs in computer science.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Internet
Connect to the full text of this electronic bookAvailable Online
| Call Number: |
QA267.7 .D68 1999 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA267.7 .D68 1999 | Available | |