Concepedia

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

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

Symposium on the Theory of Computing · 1994 · 66 citations · 0 references

Concepts