FMM: Fast Matrix Multiplication
-------------------------------

- is a library written in C++98 (actually it is a C++ class)
- implements fast algorithm for matrix multiplication
- matrix sizes have to be of the form 2^n × 2^n
- the library implements the Strassen algorithm
- the asymptotic complexity of the Strassen algorithm is O(n^2.80735)
- the naive algorithm has O(n^3)
- Strassen algorithm is faster for matrices with sizes from 32

Author
------

- David Barina <ibarina@fit.vutbr.cz>
