Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy (Extended Abstract) (1994)
| Venue: | In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing |
| Citations: | 52 - 17 self |
BibTeX
@INPROCEEDINGS{Bodlaender94beyondnp-completeness,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett},
title = {Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy (Extended Abstract)},
booktitle = {In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing},
year = {1994},
pages = {449--458},
publisher = {Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The parameterized computational complexity of a collection of well-known problems including: Bandwidth, Precedence constrained k-processor scheduling, Longest Common Subsequence, DNA physical mapping (or Intervalizing colored graphs), Perfect phylogeny (or Triangulating colored graphs), Colored cutwidth, and Feasible register assignment is explored. It is shown that these problems are hard for various levels of the W hierarchy. In the case of Precedence constrained k-processor scheduling the results can be interpreted as providing substantial new complexity lower bounds on the outcome of [OPEN 8] of the Garey and Johnson list. We also obtain the conjectured "third strike" against Perfect phylogeny.
