John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
George Markowsky
J. Math. Anal. Appl.
Imran Nasim, Melanie Weber
SCML 2024