4 citations · 7 across the 3 of their papers we have counts for
3 papers · 1 filter
New ways to multiply 3 x 3-matrices
Marijn J. H. Heule, Manuel Kauers, Martina Seidl
It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fe…
Local Search for Fast Matrix Multiplication
Marijn J. H. Heule, Manuel Kauers, Martina Seidl
Laderman discovered a scheme for computing the product of two 3x3 matrices using only 23 multiplications in 1976. Since then, some more such schemes were proposed, but it remains o…
On the maximal minimal cube lengths in distinct DNF tautologies
Manuel Kauers, Martina Seidl, Doron Zeilberger
Inspired by a recent article by Anthony Zaleski and Doron Zeilberger, we investigate the question of determining the largest k for which there exists boolean formulas in disjunctiv…