External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada. pages 449-458, ACM, 1994. [doi]

Authors

Hans L. Bodlaender

This author has not been identified. It may be one of the following persons: Look up 'Hans L. Bodlaender' in Google

Michael R. Fellows

This author has not been identified. It may be one of the following persons: Look up 'Michael R. Fellows' in Google

Michael T. Hallett

This author has not been identified. Look up 'Michael T. Hallett' in Google
runs on