# How to prove that Inner product of two $n$ dimensional vectors requires at least $n$ many multiplications?

Input : Two matrices $A$ and $B$ of size $n$ X $n$.

Compute : Matrix product $A$ X $B$.

Some of the known results about matrix multiplication are given below.

Brute Force : $O(n^3)$.