Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
amalcon
on Oct 22, 2011
|
parent
|
context
|
favorite
| on:
The Goertzel Algorithm
Indeed, a faster multi-frequency fourier transform would be a
huge
deal. It would speed up everything that involves multiplying large numbers (encryption, but also lots of biology and other scientific problems), due to FFT multiplication.
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: