Artículos relacionados a Parameterized Complexity (Monographs in Computer Science)

Parameterized Complexity (Monographs in Computer Science) - Tapa dura

Fellows, M.R.; Downey, Rodney G.

 
9780387948836: Parameterized Complexity (Monographs in Computer Science)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.