Proposed O(n log n) Integer Multiplication Algorithm Shared as PDF Paper
A PDF describing a recently proposed integer multiplication algorithm with O(n log n) complexity has been shared on Hacker News. The linked document is hosted on a University of New South Wales mathematics server. The post received 6 points and one comment at the time of the listing. The available material provides only the link and engagement metrics, so the paper's technical details and claims could not be verified from this source.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.


Discussion (0)
Log in to join the discussion and vote.
Log in