Home 24h Top Newest Best Ask Show Jobs

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

Home

Home Newest Best Ask Show Jobs

Resources

HackerNews API Original HackerNews Next.js

© 2025 TechEcho. All rights reserved.

How to compute Fib(n) in log(n) time

2 pointsby Xichekolasover 15 years ago

1 comment

cpercivaover 15 years ago

Correction: This computes Fib(n) in O(n log n log log n) time given a fast integer multiplication.

评论 #1001717 未加载