Algorithm and Design Complexity
Paperback
$65.99
Premium Members save an extra 10% and all Members collect stamps to save with Rewards. 10 stamps = $5.Learn More
Select a store to view item availability.
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 co...






















