Algebraic complexity

Arithmetic circuits over a field and the complexity of algebraic problems: matrix multiplication exponents (square, rectangular, dual) and their bounds, tensor rank, and the bit complexity of integer multiplication.

• Arithmetic circuits
• Integer multiplication in time O(n log n)
• Arithmetic circuits for matrix multiplication
• Matrix multiplication exponent

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.