Is the set cover problem NP-complete when the cardinality of the collection of sets is equal to the cardinality of the universe?

In the set cover (SC) problem we are given a universe $U$ (a set) of $n$ elements and a collection $S$ of $m$ sets whose union equals the universe. The set cover problem is to identify the smallest sub-collection of $S$ whose union equals the universe.

If I add the constraint that $m=n$ to SC, is this new problem still NP-hard?

My attempt is as follows:

To construct an instance of the new problem we do:

• If $n=m$, then we are done.

• If $n>m$, then we simply add $n-m$ dummy sets to the collection $S$ and we are done.

• If $n

Yes, it is still NP-complete. If you have an instance with $n < m$, then you can pad $U$ with $m - n + 1$ new elements and add new subset containing only the new elements. The original instance has a solution of size $s$ if and only the padded instance has a solution of size $s + 1$. The reduction is obviously polynomial time.

StackExchange Computer Science Q#65403, answer score: 6