SKU/Artículo: AMZ-1032409355

Algorithm and Design Complexity

Format:

Paperback

Hardcover

Kindle

Paperback

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.36 kg
Devolución:
No
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • 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 algorithmsDiscusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristicsProvides time and space complexity tutorialsReviews combinatorial optimization of Knapsack problemSimplifies recurrence relation for time complexityThis book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.
AR$329.913
60% OFF
AR$131.968

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

AR$329.913
60% OFF
AR$131.968

Pagá fácil y rápido con Mercado Pago o MODO

Llega en 18 a 28 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja de USA a tus manos en