  We introduce a new method for discovering matrix multiplication schemes based
on random walks in a certain graph, which we call the flip graph. Using this
method, we were able to reduce the number of multiplications for the matrix
formats (4, 4, 5) and (5, 5, 5), both in characteristic two and for arbitrary
ground fields.
