Parameterized Complexity Theory

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Flum, J. (Autor), Grohe, M. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Texts in Theoretical Computer Science. An EATCS Series,
Temas:
Computer systems.
Mathematical logic.
Algorithms.
Computer science.
Machine theory.
Computer System Implementation.
Mathematical Logic and Foundations.
Theory of Computation.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Fixed-Parameter Tractability
  • Reductions and Parameterized Intractability
  • The Class W[P]
  • Logic and Complexity
  • Two Fundamental Hierarchies
  • The First Level of the Hierarchies
  • The W-Hierarchy
  • The A-Hierarchy
  • Kernelization and Linear Programming Techniques
  • The Automata-Theoretic Approach
  • Tree Width
  • Planarity and Bounded Local Tree Width
  • Homomorphisms and Embeddings
  • Parameterized Counting Problems
  • Bounded Fixed-Parameter Tractability and Limited Nondeterminism
  • Subexponential Fixed-Parameter Tractability.

Ejemplares similares