A new complexity bound for the least-squares problem

For a least-squares problem of m degree polynomial regression with n measured values (n ≥ m + 1), the traditional methods need O(n2m) arithmetic operations. We prove that the arithmetic complexity of this problem does not exceed O(nlog22m).