Knygos.lt klubas Knygos.lt nariams
160,01 €
-30%
Įprastai
228,59 €
Algorithms and Complexity
Algorithms and Complexity
Knygos.lt klubas Knygos.lt nariams
160,01 €
-30%
Įprastai
228,59 €
  • Išsiųsime per 12–18 d.d.
This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This…
  • Leidėjas:
  • ISBN-10: 1568811780
  • ISBN-13: 9781568811789
  • Formatas: 15.5 x 23.1 x 1.8 cm, kieti viršeliai
  • Kalba: Anglų

Algorithms and Complexity (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

(4.00 Goodreads įvertinimas)

Aprašymas

This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.

Knygos.lt klubas
Knygos.lt nariams
160,01 €
-30%
Įprastai
228,59 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 2,29 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau
  • Autorius: Herbert S Wilf
  • Leidėjas:
  • ISBN-10: 1568811780
  • ISBN-13: 9781568811789
  • Formatas: 15.5 x 23.1 x 1.8 cm, kieti viršeliai
  • Kalba: Anglų

This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)