Hacker News
new
top
best
ask
show
job
Show HN: Reducing LLM Context Complexity from O(N^2) to O(k)
(
github.com
)
2 points
by
samamatariq
5 hours ago
2 comments
verdverm
3 hours ago
those for loops over input clearly indicate a new proof for runtime complexity is there too
this is textbook slop
samamatariq
5 hours ago
[flagged]