Algorithm Design: Pearson New International Edition
Höfundar:
Jon Kleinberg; Eva Tardos (Útgáfa: 1)
Kaup valmöguleikar
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. The full text downloaded to your computer With eBooks you can: search for key concepts, words and phrases make highlights and notes as you study share your notes with friends eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.
Nánar um bókina
- Pearson International Content
- 9781292037042
- 9781292023946
- Page Fidelity (PDF)
- 1
- Jon Kleinberg; Eva Tardos
- English
- 2013-08-29
- 100
- 2
- 2
Kaflar
- Table of Contents
- Chapter 1. Introduction: Some Representative Problems
- Chapter 2. Basics of Algorithm Analysis
- Chapter 3. Graphs
- Chapter 5. Divide and Conquer
- Chapter 4. Greedy Algorithms
- Chapter 6. Dynamic Programming
- Chapter 7. Network Flow
- Chapter 8. NP and Computational Intractability
- Chapter 9. PSPACE: A Class of Problems beyond NP
- Chapter 10. Extending the Limits of Tractability
- Chapter 11. Approximation Algorithms
- Chapter 13. Randomized Algorithms
- Chapter 12. Local Search
- Epilogue: Algorithms That Run Forever
- References
- Index
- A
- B
- C
- D
- E
- F
- G
- H
- I
- J
- K
- L
- M
- N
- O
- P
- Q
- R
- S
- T
- U
- V
- W
- Y
- Z