Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
We consider the bilinear complexity of certain sets of bilinear forms. We study a class of direct sums of bilinear forms. For this class of problems we show that the bilinear complexity of one direct sum is the sum of the bilinear complexities of the summands and that every minimal bilinear algorithm for computing the direct sums is a direct-sum algorithm. We also exhibit some sets of bilinear forms which belong to this class. © 1981.
J. LaRue, C. Ting
Proceedings of SPIE 1989
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998