Hacker News new | ask | show | jobs
by mFixman 2165 days ago
I think it's the O(log n) algorithm that uses matrix exponentiation to find out the n'th Fibonacci number.