|
Showing 1 - 2 of
2 matches in All Departments
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.
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.
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.