The complexity of fixed-parameter problems: guest column

Authors:
Jonathan F. Buss;Tarique M. Islam
Affiliations:
University of Waterloo, Waterloo, Ont., Canada;-
Venue:
ACM SIGACT News
Year:
2008

Citing 11
Cited 0

Nondeterminism within P

SIAM Journal on Computing
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Fixed-Parameter Tractability, Definability, and Model-Checking

SIAM Journal on Computing
The turing way to parameterized complexity

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Simplifying the weft hierarchy

Theoretical Computer Science - Parameterized and exact computation
Machine-based methods in parameterized complexity theory

Theoretical Computer Science
Algorithms in the W-Hierarchy

Theory of Computing Systems
Characterizing hardness in parameterized complexity

Characterizing hardness in parameterized complexity
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe how to found and develop the theory of fixed-parameter complexity and hardness in a manner both fully analgous to the classical theory of NP-completeness and much simpler than the original development. We present some recent advance made using this approach.