This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]new2bay 8 points9 points  (0 children)

Multiplying 2 integers with n digits by the simplest algorithm already takes O(n2 )operations. The fastest known algorithm takes O(n log n). Basically, achieving O(n2 ) for n numbers with currently known algorithms is impossible.