Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
We prove the direct sum conjecture for various sets of systems of bilinear forms. Our results depend on a priori knowledge of the complexity of at least one of the direct summands and its underlying algebraic structure. We also briefly survey some previous results concerning the complexity and structure of minimal algorithms for various direct sum systems. © 1984.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
Fernando Martinez, Juntao Chen, et al.
AAAI 2025