Sankar Basu
Journal of the Franklin Institute
The number of binary operations required to compute ∑ i=1 xiyi nis shown to be 2n - 1 even when auxiliary functions are used. © 1971.
Sankar Basu
Journal of the Franklin Institute
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering