# Matrix Multiplication

**Computer Science**Level 2

Think about the matrix multiplication problem. It is defined as A(mxn) X B(nxp) = C(mxp). This requires O(nxmxp) number of additions and multiplications. My question is is it somehow possible to have an approximate resultant matrix with lesser number of operations? I mean the resultant matrix C need not be an exact one; elements of C may vary slightly from actual element. Can you work with this?