This article serves as a companion to the video essay [9] by Sheafification of G on computing large Fibonacci numbers quickly. We follow the same progression of methods-from naive recursion to sophisticated Fourier transforms-and elaborate the concepts that were impractical to discuss in video format.
原文链接
分享
引用
