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, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.
- ISBN13 9781461267980
- Publish Date 8 October 2012 (first published 6 November 1998)
- Publish Status Active
- Publish Country US
- Imprint Springer-Verlag New York Inc.
- Edition Softcover reprint of the original 1st ed. 1999
- Format Paperback
- Pages 533
- Language English