The hitting set problem is "W"[2]-complete for the parameter OPT, that is, it is unlikely that there is an algorithm that runs in time "f"(OPT)"n" where OPT is the cardinality of the smallest hitting set.