Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
vang3lis
on July 7, 2009
|
parent
|
context
|
favorite
| on:
On the Linear Time Algorithm For Finding Fibonacci...
That and the fact that computing the closed form expression still needs log(n) steps (as exponentiation).
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
