Loading... Please wait...

Arithmetic Complexity of Computations

Hover over image to zoom

Order Code:

 Product Description

by Shmuel Winograd


1980 / iii + 93 pages / Softcover / ISBN: 978-0-898711-63-9 / List Price $53.00 / SIAM/CBMS Member Price $37.10 / Order Code CB33

Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms.

Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation.

Three Examples; General Background; Product of Polynomials; FIR Filters; Product of Polynomials Modulo a Polynomial; Cyclic Convolution and Discrete Fourier Transform.

ISBN: 9780898711639 

 Find Similar Products by Category

Vendors Other Products

 Product Reviews

This product hasn't received any reviews yet. Be the first to review this product!

You Recently Viewed...



Follow us on

Copyright 2019 SIAM Bookstore. All Rights Reserved.
Sitemap | BigCommerce Premium Themes by PSDCenter

Society for Industrial and Applied Mathematics 3600 Market St., 6th Fl. Philadelphia, PA 19104-2688 USA +1-215-382-9800 FAX: +1-215-386-7999 www.siam.org email: siambooks@siam.org

Click the button below to add the Arithmetic Complexity of Computations to your wish list.