Gratisversand in ganz Deutschland!
Bookbot

Greedy Approximation

Parameter

  • 434 Seiten
  • 16 Lesestunden

Mehr zum Buch

The book offers a comprehensive exploration of the theoretical foundations essential for understanding algorithms in numerical mathematics. It covers both classical results and the latest advancements in the field, making it a valuable resource for those seeking to deepen their knowledge of numerical algorithms and their applications.

Buchkauf

Greedy Approximation, Vladimir Temlyakov

Sprache
Erscheinungsdatum
2018
product-detail.submit-box.info.binding
(Hardcover)
Wir benachrichtigen dich per E-Mail.

Lieferung

  • Gratis Versand in ganz Deutschland!

Zahlungsmethoden

Keiner hat bisher bewertet.Abgeben