On the circuit complexity of the standard and the Karatsuba methods of multiplying integers
arXiv:1602.02362
Abstract
We provide accurate upper bounds on the Boolean circuit complexity of the standard and the Karatsuba methods of integer multiplication
arXiv comment6 pages, published in Russian in Proc. XXII Conf. "Information means and technology" (Moscow, November 18--20, 2014). Vol. 3. Moscow, MPEI, 2014, 180--187