Bemærk: Kan ikke leveres før jul.
Forventes på lager: 19-12-2024
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.
| Forlag | Taylor & Francis Ltd |
| Forfattere | Anli (University of Technology Sarawak Sherine, Mary (Infant Jesus College of Engineering Jasmine, Geno (University of Technology Sarawak Peter, S. Albert (Vellore Institute of Technology Alexander |
| Type | Bog |
| Format | Paperback / softback |
| Sprog | Engelsk |
| Udgivelsesdato | 19-12-2024 |
| Første udgivelsesår | 2024 |
| Illustrationer | 2 Tables, black and white; 72 Line drawings, black and white; 72 Illustrations, black and white |
| Originalsprog | United Kingdom |
| Sideantal | 182 |
| Indbinding | Paperback / softback |
| Forlag | Taylor & Francis Ltd |
| Sideoplysninger | 182 pages, 2 Tables, black and white; 72 Line drawings, black and white; 72 Illustrations, black and |
| Mål | 234 x 156 |
| ISBN-13 / EAN-13 | 9781032409351 |