Re:Attention at Constant Cost per Token via Symmetry-Aware T...
by oasisaimlessly on Wednesday February 04, 2026 @12:48PM
(#46888986)
That argument could also be used to say that the FFT's time complexity of O(n log n) should be impossible.
[ Parent
| on HN ]
There are no comments on this comment yet.