bilinear-complexity

Here are 2 public repositories matching this topic...

Tewf / tensor-rank-toolkit

Exact tensor and bilinear rank over finite fields: lower bounds, exhaustive search, SAT with DRAT-checkable refutations, symmetry reduction, and operator sparsification proved minimal against PLinOpt, with a local web console. C++20 on Givaro.

research cpp computer-algebra optimization matrix-multiplication finite-fields sat-solver strassen cpp20 sparsification tensor-rank bilinear-complexity givaro

Updated Sep 4, 2026
C++

big-brain-zaru / FastMatrixF2

Star

Exact symmetry-stratified search for fast matrix multiplication over F2: a second inequivalent rank-47 scheme for 4x4, rigidity theorems, and large same-rank families at 5x5 and 6x6

computer-algebra matrix-multiplication finite-fields strassen sat-solving alphatensor bilinear-complexity brent-equations

Updated Sep 18, 2026
Python

Add this topic to your repo

To associate your repository with the bilinear-complexity topic, visit your repo's landing page and select "manage topics."

Learn more