Osobný odber v Bratislave stíhaš do Vianoc
Bookbot

Vladimir Temlyakov

    Greedy Approximation
    • Greedy Approximation

      • 434 stránok
      • 16 hodin čítania

      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.

      Greedy Approximation