𝔖 Scriptorium
✦   LIBER   ✦
Cover of Arithmetic, proof theory, and computational complexity
πŸ“

Arithmetic, proof theory, and computational complexity

Publisher
New York : Clarendon Press ; Oxford, Eng. ; New York : Oxford University Press
Year
1993
Tongue
English
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

xii, 428 p. ; 25 cm

πŸ“œ SIMILAR VOLUMES

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

Computation and Proof Theory
πŸ“ Computation and Proof Theory
✍ Richter M.M. (ed.), Borger E. (ed.), Oberschelp W. (ed.) πŸ“‚ Library πŸ“… 1984 🌐 English

Lecture notes in mathematics No.1104

Arithmetic complexity of computations
πŸ“ Arithmetic complexity of computations
✍ Shmuel Winograd πŸ“‚ Library πŸ“… 1987 πŸ› Society for Industrial and Applied 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 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