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:

    I believe that history might be, and ought to be, taught in a new fashion so as to make the meaning of it as a process of evolution intelligible to the young.
    Thomas Henry Huxley (1825–95)

    It’s a very delicate surgical operation—to cut out the heart without killing the patient. The history of our country, however, is a very tough old patient, and we’ll do the best we can.
    Dudley Nichols, U.S. screenwriter. Jean Renoir. Sorel (Philip Merivale)

    Social history might be defined negatively as the history of a people with the politics left out.
    —G.M. (George Macaulay)