# What is the standard algorithm for largest rank submatrix?

Given a matrix over $$\mathbb R^{n\times m}$$ of rank $$r$$ what is the complexity to find the largest full-rank submatrix of rank $$k$$?