| Physical description |
xv, 533 pages : illustrations ; 24 cm. |
| Series |
Monographs in computer science. |
|
Monographs in computer science.
|
| Notes |
New Zealand authors. |
| Bibliography |
Includes bibliographical references (pages 489-516) and index. |
| 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. |
| Other author |
Fellows, Michael R.
|
| Subject |
Computational complexity.
|
| ISBN |
038794883X (hardback) $59.95 |
|
