The complexity of fixed-parameter problems: guest column

The complexity of fixed-parameter problems: guest column

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIGACT news 2008-03, Vol.39 (1), p.33-46
Hauptverfasser: Buss, Jonathan F., Islam, Tarique M.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0163-5700
DOI:10.1145/1360443.1360454