Computational Tractability: The View From Mars (0)
| Venue: | Bulletin of the European Association of Theoretical Computer Science |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Downey_computationaltractability:,
author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege},
title = {Computational Tractability: The View From Mars},
booktitle = {Bulletin of the European Association of Theoretical Computer Science},
year = {},
pages = {73--97}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a point of view about the parameterized computational complexity framework in the broad context of one of the central issues of theoretical computer science as a field: the problem of systematically coping with computational intractability. Those already familiar with the basic ideas of parameterized complexity will nevertheless find here something new: the emerging systematic connections between fixed-parameter tractability techniques and the design of useful heuristic algorithms, and also perhaps the philosophical maturation of the parameterized complexity program.
