Trending Bestseller

Algorithm and Design Complexity

Anli Sherine

No reviews yet Write a Review
Hardback
04 May 2023
$321.00
Ships in 3-5 business days
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.

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

$321.00
Ships in 3-5 business days
Hurry up! Current stock:

Algorithm and Design Complexity

$321.00

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.

Customers Also Viewed

Buy Books Online at BookLoop

Discover your next great read at BookLoop, Australiand online bookstore offering a vast selection of titles across various genres and interests. Whether you're curious about what's trending or searching for graphic novels that captivate, thrilling crime and mystery fiction, or exhilarating action and adventure stories, our curated collections have something for every reader. Delve into imaginative fantasy worlds or explore the realms of science fiction that challenge the boundaries of reality. Fans of contemporary narratives will find compelling stories in our contemporary fiction section. Embark on epic journeys with our fantasy and science fiction titles,

Shop Trending Books and New Releases

Explore our new releases for the most recent additions in romance books, fantasy books, graphic novels, crime and mystery books, science fiction books as well as biographies, cookbooks, self help books, tarot cards, fortunetelling and much more. With titles covering current trends, booktok and bookstagram recommendations, and emerging authors, BookLoop remains your go-to local australian bookstore for buying books online across all book genres.

Shop Best Books By Collection

Stay updated with the literary world by browsing our trending books, featuring the latest bestsellers and critically acclaimed works. Explore titles from popular brands like Minecraft, Pokemon, Star Wars, Bluey, Lonely Planet, ABIA award winners, Peppa Pig, and our specialised collection of ADHD books. At BookLoop, we are committed to providing a diverse and enriching reading experience for all.