3 papers
cs.CC2026
Partition Rank and Algebraic Circuit Lower Bounds
Cornelius Brand, Petteri Kaski, Jiaheng Wang
Strassen's theory of bilinear complexity provides a mathematical characterization of the arithmetic complexity of primitives such as matrix multiplication via the rank of tensors.…
cs.CC2026
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
Cornelius Brand, Radu Curticapean, Petteri Kaski +4
The complexity of bilinear maps (equivalently, of -mode tensors) has been studied extensively, most notably in the context of matrix multiplication. While circuit complexity and…
cs.DS2025
Faster Convolutions: Yates and Strassen Revisited
Cornelius Brand, Radu Curticapean, Baitian Li +1
Given two vectors over a finite domain and a function , the convolution problem asks to compute the vector whose…