jeremyscanvic
Joined 3 years ago
Karma
332
Submissions
83
Member since
Nov 4
https://jeremyscanvic.com/
View on Hacker NewsJoined 3 years ago
Edit: Another example of that is the complexity of convolutional filtering, which is O(n min(log n, k)) for a signal of length n and a kernel of size k.
I wouldn't have guessed this is true. I'm wondering what the proof looks like!