Set Cover is a well-studied problem in the field of parameterized complexity which is known to be W[2]-hard when parameterized by the natural parameter \(t\)  [1]}.
We refer to the textbook by Cygan et al. [2]} for additional reading on parameterized complexity.
