Narrow your search

Library

ULiège (2)

KU Leuven (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

UHasselt (1)

ULB (1)

UNamur (1)

VIVES (1)


Resource type

book (2)


Language

English (2)


Year
From To Submit

2006 (2)

Listing 1 - 2 of 2
Sort by
Fractals everywhere
Author:
ISBN: 9780120790692 0120790696 Year: 2006 Publisher: San Diego: Morgan Kaufmann,

Parameterized Complexity Theory
Authors: ---
ISBN: 3540299521 9783540299523 3642067573 9786610625741 1280625740 354029953X Year: 2006 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Keywords

Computer science --- Computational complexity. --- Algorithms. --- Complexité de calcul (Informatique) --- Algorithmes --- Nonlinear systems -- Mathematical models. --- System theory -- Mathematical models. --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Complexité de calcul (Informatique) --- EPUB-LIV-FT LIVINFOR SPRINGER-B --- Algorism --- Complexity, Computational --- Computer science. --- Architecture, Computer. --- Computers. --- Mathematical logic. --- Computer Science. --- Computer System Implementation. --- Mathematical Logic and Foundations. --- Algorithm Analysis and Problem Complexity. --- Theory of Computation. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Arithmetic --- Foundations --- Electronic data processing --- Machine theory --- Computer network architectures. --- Logic, Symbolic and mathematical. --- Computer software. --- Information theory. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Software, Computer --- Computer systems --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Calculators --- Cyberspace --- Architecture, Computer --- Informatique --- Graphes, Théorie des --- Algorithmique --- Automates abstraits --- Complexite --- Computer architecture.

Listing 1 - 2 of 2
Sort by