1. Walter Baur and Volker Strassen. 1983. The complexity of partial derivatives. Theoretical computer science, 22, 3 (1983), 317–330.
2. The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True
3. Markus Bläser. 2013. Fast matrix multiplication. Theory of Computing 1–60.
4. Peter Bürgisser, Michael Clausen, and Mohammad A Shokrollahi. 2013. Algebraic complexity theory. 315, Springer Science & Business Media.
5. Group-theoretic Algorithms for Matrix Multiplication