John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
On the direct sum conjecture
Abstract
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.
Related
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008