Given a matrix $X \in \mathbb{R}^{m\times n}$, where $m \gt n$.
Suppose, I get to choose any $n$ unique rows from $X$ to form a new matrix $Y_i \in \mathbb{R}^{n\times n}$. And it's guranteed all the $Y_i$ has positive determinant by applying absolute value.
What's the best way to pick $Y_{max}$ and $Y_{min}$ that has maximum determinant and minimum determinant?
A straight forward way maybe scan all ${m \choose n}$ different $Y_i$, but not necessary efficient if $m \gt \gt n$.