Karatsuba Algorithm - History

History

The standard procedure for multiplication of two n-digit numbers requires a number of elementary operations proportional to, or in the big-O notation. In 1952, Andrey Kolmogorov conjectured that the classical algorithm was asymptotically optimal, meaning that any algorithm for that task would require elementary operations.

In 1960, Kolmogorov organized a seminar on mathematical problems in cybernetics at the Moscow State University, where he stated the conjecture and other problems in the complexity of computation. Within a week, Karatsuba, then a 23-year-old student, found an algorithm (later it was called "divide and conquer") that multiplies two n-digit numbers in elementary steps, thus disproving the conjecture. Kolmogorov was very agitated about the discovery; he communicated it at the next meeting of the seminar, which was then terminated. Kolmogorov published the method in 1962, in the Proceedings of the USSR Academy of Sciences. The article had been written by Kolmogorov, possibly in collaboration with Yuri Ofman, but listed "A. Karatsuba and Yu. Ofman" as the authors. Karatsuba only became aware of the paper when he received the reprints from the publisher.

Read more about this topic:  Karatsuba Algorithm

Famous quotes containing the word history:

    The one duty we owe to history is to rewrite it.
    Oscar Wilde (1854–1900)

    The disadvantage of men not knowing the past is that they do not know the present. History is a hill or high point of vantage, from which alone men see the town in which they live or the age in which they are living.
    Gilbert Keith Chesterton (1874–1936)

    The custard is setting; meanwhile
    I not only have my own history to worry about
    But am forced to fret over insufficient details related to large
    Unfinished concepts that can never bring themselves to the point
    Of being, with or without my help, if any were forthcoming.
    John Ashbery (b. 1927)