It looks like you're new here. If you want to get involved, click one of these buttons!
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).