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 |
| Summary: | 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 classes of algorithms which may be analysed more precisely than hereto. The authors have made the book as self-contained as possible and a lot of background material is included. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest in this book. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (xv, 533 pages) : illustrations. |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |
| Bibliography: | Includes bibliographical references (pages 489-516) and index. |
| ISBN: | 9781461205159 (electronic bk.) 1461205158 (electronic bk.) |