SKU/Artículo: AMZ-3642067573

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Format:

Paperback

Hardcover

Paperback

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.91 kg
Devolución:
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • 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.The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
U$S 224,98
60% OFF
U$S 89,99

IMPORTÁ FACIL

Comprando este producto podrás descontar el IVA con tu número de RUT

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 224,98
60% OFF
U$S 89,99

¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!

Llega en 5 a 11 días hábiles
con envío
Tienes garantía de entrega