The Algorithm Design Manual (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
793
Utgivningsdatum
2020-10-06
Upplaga
3rd ed. 2020
Förlag
Springer Nature Switzerland AG
Illustrationer
1 Illustrations, black and white; XVII, 793 p. 1 illus.
Dimensioner
234 x 176 x 38 mm
Vikt
1476 g
Antal komponenter
1
Komponenter
1 Hardback
ISBN
9783030542559

The Algorithm Design Manual

Inbunden,  Engelska, 2020-10-06
1172
  • Skickas från oss inom 5-8 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 3 format & utgåvor
Expanding on the highly successful formula of the first edition, this book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.
Visa hela texten

Passar bra ihop

  1. The Algorithm Design Manual
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 1461 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Steven S Skiena

Övrig information

Dr. Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University, with research interests in data science, natural language processing, and algorithms. He was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award for outstanding contributions to undergraduate education ...and for influential textbooks and software.

Innehållsförteckning

TO UPDATE Practical Algorithm Design.- to Algorithm Design.- Algorithm Analysis.- Data Structures.- Sorting and Searching.- Graph Traversal.- Weighted Graph Algorithms.- Combinatorial Search and Heuristic Methods.- Dynamic Programming.- Intractable Problems and Approximation Algorithms.- How to Design Algorithms.- The Hitchhikers Guide to Algorithms.- A Catalog of Algorithmic Problems.- Data Structures.- Numerical Problems.- Combinatorial Problems.- Graph Problems: Polynomial-Time.- Graph Problems: Hard Problems.- Computational Geometry.- Set and String Problems.- Algorithmic Resources.