Knihobot

Greedy Approximation

Parametry

  • 434 stránek
  • 16 hodin čtení

Více o knize

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.

Nákup knihy

Greedy Approximation, Vladimir Temlyakov

Jazyk
Rok vydání
2018
product-detail.submit-box.info.binding
(pevná)
Jakmile se objeví, pošleme e-mail.

Doručení

Platební metody

Nikdo zatím neohodnotil.Ohodnotit