Is there any algorithm for "Longest increasing subsequence" with complexity less than O(n^2)?

I just want to know that while using dp for Longest increasing subsequence we get a complexity of O(n^2). Is there any other algorithm by which we can reduce the complexity??? Please explain the algo if it exists.