arithmetic_complexity_of_computations.djvu-WaRlOrD

Arithmetic Complexity of Computations (CBMS-NSF Regional Conference Series in Applied Mathematics): Shmuel Winograd Society for Industrial Mathematics | ISBN: 0898711630 | 1987-01-01 | djvu (ocr) | 97 pages | 1.11 Mb 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.

udp://tracker.openbittorrent.com:80
udp://open.demonii.com:1337
udp://tracker.coppersurfer.tk:6969
udp://exodus.desync.com:6969