Parameterized Complexity. Este artículo no está disponible.
Idioma: inglés
Editorial: Springer, 2012
- Tapa blanda
- Usado
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Vendedor de 5 estrellas
Vendedor de AbeBooks desde el 6 de abril de 2009
No disponible
Tapa blanda
Condición: Usado - Como Nuevo
EUR 313,25
Descripción del artículo del vendedor
Unread book in perfect condition.
N° de ref. del artículo 19199703
- Título
- Parameterized Complexity
- Autor
- Downey, Rodney G.; Fellows, M.r.
- Editorial
- Springer
- Año de publicación
- 2012
- Estado
- As New
- Encuadernación
- Encuadernación de tapa blanda
- Idioma
- inglés
- ISBN 10
- 1461267986
- ISBN 13
- 9781461267980
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.
“Sinopsis” puede pertenecer a otra edición de este título.
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.
“Acerca de” puede pertenecer a otra edición de este título.