About approximate bilinear complexity of matrix multiplication
This paper shows that the approximate bilinear complexity of multiplication of matrices of size $2\times2$ and $2\times6$ does not exceed 19. Clearly presented the approximate bilinear algorithm of 19 for this task.