Hacker News
Newest
Ask HN
Show HN
Submit
Show HN: Reducing LLM Context Complexity from O(N^2) to O(k)
(github.com)
2
points by samamatariq
•
verdverm
•
those for loops over input clearly indicate a new proof for runtime complexity is there too
this is textbook slop
