Algorithm and Design Complexity - Brossura

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

 
9781032409351: Algorithm and Design Complexity
Brossura
ISBN 10: 1032409355 ISBN 13: 9781032409351
Casa editrice: CRC Press, 2024

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Anli Sherine, S. Albert Alexander

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
CRC Press
Data di pubblicazione
2024
Lingua
Inglese
ISBN 10 
1032409355
ISBN 13 
9781032409351
Rilegatura
Copertina flessibile
Numero edizione
1
Numero di pagine
182
Contatto del produttore
Taylor and Francis, GPSR Taylor and Francis
gpsr@taylorandfrancis.com

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

Altre edizioni note dello stesso titolo

9781032409320: Algorithm and Design Complexity

Edizione in evidenza

ISBN 10:  1032409320 ISBN 13:  9781032409320
Casa editrice: CRC Press, 2023
Rilegato