Toom-Cook algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Named after Andrei Toom and Stephen Cook.

Proper noun[edit]

Toom-Cook algorithm

  1. (computing theory) A multiplication algorithm that multiplies large integers by recursively splitting them into smaller parts and performing operations on the parts.