Boolean matrix multiplication.

ciechowoj

I need an algorithm for boolean matrix multiplication, but with complexity O(n^2.81 / log_2^0.4 n). Naive approach is O(n^3). I know about Strassen algorithm and four russians algorithms but they are too slow (O(n^2.81) and O(n^3 / log_2 n) respectively).

Icepickle

according to wikipedia, there are some faster ones (check See also section)

http://en.wikipedia.org/wiki/Strassen_algorithm

for the rest, your question is quite limited