Algorithm and Design Complexity - Tapa blanda

Sherine, Anli; Jasmine, Mary; Peter, Geno; Alexander, S. Albert

 
9781032409351: Algorithm and Design Complexity
Tapa blanda
ISBN 10: 1032409355 ISBN 13: 9781032409351
Editorial: CRC Press, 2024

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

Anli Sherine, S. Albert Alexander

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
CRC Press
Año de publicación
2024
Idioma
Inglés
ISBN 10 
1032409355
ISBN 13 
9781032409351
Encuadernación
Tapa blanda
Número de edición
1
Número de páginas
182
Contacto del fabricante
Taylor and Francis, GPSR Taylor and Francis
gpsr@taylorandfrancis.com

Taylor & Francis Verlag GmbH, Kaufingerstraße 24
München
80331
Alemania

Otras ediciones populares con el mismo título

9781032409320: Algorithm and Design Complexity

Edición Destacada

ISBN 10:  1032409320 ISBN 13:  9781032409320
Editorial: CRC Press, 2023
Tapa dura