Anli (University of Technology Sarawak, Malaysia) Sherine,
Mary (Infant Jesus College of Engineering, India) Jasmine,
Geno (University of Technology Sarawak, Malaysia) Peter,
S. Albert (Vellore Institute of Technology, India) Alexander
e.a.
Taylor & Francis Ltd
e druk, 2024
9781032409351
Algorithm and Design Complexity
Specificaties
Paperback, 182 blz.
|
EN
Taylor & Francis Ltd |
e druk, 2024
ISBN13: 9781032409351
Rubricering
Levertijd ongeveer 15 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9781032409351
Taal:EN
Bindwijze:Paperback
Aantal pagina's:182
Uitgever:Taylor & Francis Ltd