Vendeur
GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 6 avril 2009
Unread book in perfect condition. N° de réf. du vendeur 19199703
This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.
Présentation de l'éditeur: 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.
Titre : Parameterized Complexity
Éditeur : Springer
Date d'édition : 2012
Reliure : Couverture souple
Etat : As New