Inicio > > Ciencias de la computación > Parameterized Complexity
Parameterized Complexity

Parameterized Complexity

M.R. Fellows / Rodney G. Downey

267,92 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2012
Materia
Ciencias de la computación
ISBN:
9781461267980
267,92 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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.

Artículos relacionados

Otros libros del autor

  • Parameterized Complexity
    M.R. Fellows / Rodney G. Downey
    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 ...