Trending Bestseller

Algorithm and Design Complexity

No reviews yet Write a Review
Hardback
04 May 2023
$378.22
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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.

You Can Find This Title In

    Product Details
    ISBN-13
    9781032409320
    Author
    Anli Sherine
    Publisher
    Taylor & Francis Ltd
    Published
    04 May 2023
    Format
    Hardback

    This product hasn't received any reviews yet. Be the first to review this product!

    $378.22
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Algorithm and Design Complexity

    $378.22

    Description

    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.

    You Can Find This Title In

      This Title Is Categorised As