## Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett

*Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy*

STOC, 1994.

@inproceedings{STOC-1994-BodlaenderFH, author = "Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett", booktitle = "{Proceedings of the 26th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/195058.195229", isbn = "0-89791-663-8", pages = "449--458", publisher = "{ACM}", title = "{Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy}", year = 1994, }