Opening book details…
Can I read Arithmetic Complexity of Computations on EtoBox?
Arithmetic Complexity of Computations by Winograd, S is a book available to read on EtoBox.
What is Arithmetic Complexity of Computations about?
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., Issue: 0, \"Based on lectures given by the author at the University of Pittsburgh.\", Bibliography: p. 93
- Author
- Winograd, S
- Publisher
- Philadelphia, Pa. : Society for Industrial and Applied Mathematics
- Published
- 1980
- Language
- EN
More by Winograd, S
Browse all works by Winograd, S
Similar books
- Complexity of Parallel Computations — Ian Parberry (1987)
- Algorithms for Rational Function Arithmetic — Horowitz.
- Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization, 10) — V. Kreinovich, A.V. Lakeyev, J. Rohn, P.T. Kahl, Patrick Kahl, Jiri Rohn, Anatoly (1997)
- Approximate Arithmetic Circuit Architectures for FPGA-based Systems — Salim Ullah; Akash Kumar (2023)
- Polynomial and Matrix Computations - Fundamental Algorithms VoI. 1 — Dario Bini, Victor Y. Pan (auth.) (1994)
- Arithmetic : The Foundation of Mathematics — Garrett Gladle; J. E Luebering; Anthony L Green; Hope Lourie Kilcoyne; Nelson Sá; Brian Garvey; Cindy Reiman; Barbara Gottfried Hollander (2015)