Título: Paramaterized Complexity Theory
Autor: Jorg Flum, M. Grohe
Sinopse: Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic. Acabamento: Hardcover. Peso: 550g. Dimensões: 23 x 16 x 1.
Contexto da obra
Dentro do catálogo, este livro pode ser situado a partir do tema, da autoria e da proposta editorial. “Paramaterized Complexity Theory”, de Jorg Flum, M. Grohe, publicado pela editora Springer Verlag *, em 2006 e com 493 páginas, integra a categoria Ciência da Computação. Esse enquadramento pode tornar mais clara a proposta do livro e o tipo de interesse que ele costuma despertar.
Editora: Springer Verlag *
Páginas: 493
Ano: 2006
Edição: 1ª EDIÇÃO
ISBN:
ISBN13: 9783540299523
