Monthly Archives: May 2012

Complexity and Asymptotes

A friend pointed out to me that the statement that the final divide-and-conquer Fibonacci algorithm from the previous post could run in time was a bit misleading. The objection was that I had assumed that the matrix multiplication would not depend on … Continue reading

Posted in Programming | Leave a comment