𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Arithmetic complexity of computations

✍ Scribed by Shmuel Winograd

Publisher
Society for Industrial and Applied Mathematics
Year
1987
Tongue
English
Leaves
100
Series
CBMS-NSF regional conference series in applied mathematics 33
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Arithmetic Complexity of Computations
πŸ“ Arithmetic Complexity of Computations
✍ Shmuel Winograd πŸ“‚ Library πŸ“… 1987 πŸ› Society for Industrial Mathematics 🌐 English

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. <P>Results that lead to applicati

Arithmetic Complexity of Computations
πŸ“ Arithmetic Complexity of Computations
✍ Shmuel Winograd πŸ“‚ Library πŸ“… 1980 πŸ› Society for Industrial Mathematics 🌐 English

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. <P>Results that lead to applicati

Arithmetic complexity of computations
πŸ“ Arithmetic complexity of computations
✍ Shmuel Winograd πŸ“‚ Library πŸ“… 1987 πŸ› Society for Industrial and Applied Mathematics 🌐 English

This monograph focuses on finding the minimum number of arithmetic operations needed to compute the solution to a system of bilinear forms, and on finding a better algorithm for such computations. The author concentrates on results applicable in the area of signal processing. Two reasons for this ar

Arithmetic, Proof Theory, and Computatio
πŸ“ Arithmetic, Proof Theory, and Computational Complexity
✍ Peter Clote, Jan KrajΓ­cek πŸ“‚ Library πŸ“… 1993 πŸ› Oxford University Press, USA 🌐 English

This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory": the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-ye