Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.
Features:
- Includes complete coverage of basics and design of algorithms
- Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics
- Provides time and space complexity tutorials
- Reviews combinatorial optimization of Knapsack problem
- Simplifies recurrence relation for time complexity
This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.
Zahle einfach mit Karte, Klarna, Apple Pay oder Google Pay. Nicht zufrieden? Du hast immer ein 14-tägiges Widerrufsrecht. Lies mehr in unseren AGB. Hast du Fragen, schreib uns eine E-Mail an hello@memmo.org.
Memmo macht das Lernen einfacher – wo auch immer du bist. Bei uns findest du deine Kursbücher und smarte Lerntools an einem Ort: Zusammenfassungen, Quizzes, Podcasts und Lernkarten. Und Ted, dein Lernbuddy, beantwortet alles, was du wissen möchtest. Über 50.000 Studierende lernen bereits hier – gemacht, damit du schneller lernst und weniger Stress hast.