Algorithm and Design Complexity
Anli (University of Technology Sarawak, Malaysia) Sherine, Geno (University of Technology Sarawak, Malaysia) Peter, Mary (Infant Jesus College of Engineering, India) Jasmine, S. Albert (Vellore Institute of Technology, India) Alexander
Taylor & Francis Ltd, 2023
220,75 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9781032409320
- ISBN-10
- 1032409320
- Publisher
- Taylor & Francis Ltd
- Year
- 2023
- Publication date
- 2023-05-04
- Pages
- 182
- Dimensions
- 234x156x
- Weight
- 520