2 Replies - 707 Views - Last Post: 18 October 2019 - 03:58 PM

#1 Skydiver   User is online

  • Code herder
  • member icon

Reputation: 7132
  • View blog
  • Posts: 24,225
  • Joined: 05-May 12

Integer multiplication in time O(n log n)

Posted 18 October 2019 - 10:53 AM

This came up on my Android news feed:
Mathematicians Have Discovered an Entirely New Way to Multiply Large Numbers

Their paper's web page: Integer multiplication in time O(n log n)

The work currently has not yet been peer reviewed, but if every checks out it's going to be another advancement for computer science.

Is This A Good Question/Topic? 2
  • +

Replies To: Integer multiplication in time O(n log n)

#2 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon




Reputation: 12657
  • View blog
  • Posts: 45,831
  • Joined: 27-December 08

Re: Integer multiplication in time O(n log n)

Posted 18 October 2019 - 03:23 PM

This is not terribly new. :)

https://www.dreaminc...-on-log-n-time/
Was This Post Helpful? 1
  • +
  • -

#3 Skydiver   User is online

  • Code herder
  • member icon

Reputation: 7132
  • View blog
  • Posts: 24,225
  • Joined: 05-May 12

Re: Integer multiplication in time O(n log n)

Posted 18 October 2019 - 03:58 PM

Lol! You are right. Repackaged news...
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1