Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithm and Design Complexity de Anli Sherine

Algorithm and Design Complexity

Autor Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander
en Limba Engleză Hardback – 4 mai 2023
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.
Citește tot Restrânge

Preț: 101732 lei

Preț vechi: 127164 lei
-20%

Puncte Express: 1526
Paperback 38175 lei
Hardback 101732 lei

Carte tipărită la comandă

Livrare economică 11-25 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9781032409320
ISBN-10: 1032409320
Pagini: 196
Ilustrații: 2 Tables, black and white; 72 Line drawings, black and white; 72 Illustrations, black and white
Dimensiuni: 156 x 234 x 13 mm
Greutate: 0.52 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press

Public țintă

Academic and Postgraduate

Cuprins

1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.

Descriere

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.