Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Arithmetic Complexity of Computations

Name: Arithmetic Complexity of Computations
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02049979
Price: 62.71 EUR
Availability: InStock
Author: Shmuel Winograd
ISBN: 9780898711639

Shmuel Winograd

Language

English

Book Paperback

Libristo code: 02049979

Publishers Society for Industrial & Applied Mathematics,U.S., January 1987

Focuses on finding the minimum number of arithmetic operations needed to perform the computation and... Full description

Libristo code: 02049979

152 b

62.71 €

In stock at our supplier Shipping in 14-20 days

Up to 30 days for returns

Customers also purchased

Antimateria, adroterapia e buchi neri Catalina Oana Curceanu

Paperback

25.28 €

Ausflugsziele Schwäbische Alb Jürgen Meyer

Paperback

16.48 €

Der Nordafrika-Vortrag Christian Gottlieb Ludwigs Mounir Fendri

Paperback

13.34 €

Der Teufelsfürst Silvia Stolzenburg

Hardback

17.69 €

Grundlagen erfolgreicher Mitarbeiterführung Hartmut Laufer

Hardback

20.52 €

Zentralschweiz Glarus/ Alpstein Remo Kundert

Paperback

49.35 €

Munchen im Lied Wilhelm Steuerwald

Paperback

33.88 €

Bilder aus dem roemisch-germanischen Kulturleben Carl Blümlein

Paperback

33.88 €

Schildkröten Manfred Rogner

Hardback

17.89 €

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.