How Can We Speed Up Matrix Multiplication?

Due to the new algebraic methods of algorithm design, recently it became possible to perform multiplication and inversion of N × N matrices using O(N2.496 ) rather than O(N³ ) arithmetical operations. Consequently, algorithms for several other computational problems of linear algebra and combinatorics have been accelerated. The major ideas and techniques that have led to that progress are surveyed.