In this paper, we briefly survey some of the latest developments and applications by using Krylov subspace methods for solving Toeplitz-like systems. One ofthe main results is that the complexity of solving a large class of n-by-n Toeplitz systems can be reduced to O(n log n) operations. Some applications are studied.