Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Arithmetic Complexity of Computations

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

Shmuel Winograd

Língua

Inglês

Livro Capa mole

Código Libristo: 02049979

Editoras Society for Industrial & Applied Mathematics,U.S., janeiro 1987

Focuses on finding the minimum number of arithmetic operations needed to perform the computation and... Descrição completa

Código Libristo: 02049979

144 b

59.57 €

Armazenamento externo Envio em 14-20 dias

Até 30 dias para devoluções

Os clientes também compraram

Der Nordafrika-Vortrag Christian Gottlieb Ludwigs Mounir Fendri

Capa mole

12.63 €

Ausflugsziele Schwäbische Alb Jürgen Meyer

Capa mole

16.48 €

Antimateria, adroterapia e buchi neri Catalina Oana Curceanu

Capa mole

23.76 €

Der Teufelsfürst Silvia Stolzenburg

Livro de capa dura

16.78 €

Grundlagen erfolgreicher Mitarbeiterführung Hartmut Laufer

Livro de capa dura

20.52 €

Zentralschweiz Glarus/ Alpstein Remo Kundert

Capa mole

46.83 €

Munchen im Lied Wilhelm Steuerwald

Capa mole

32.16 €

Bilder aus dem roemisch-germanischen Kulturleben Carl Blümlein

Capa mole

32.16 €

Schildkröten Manfred Rogner

Livro de capa dura

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.