Algorithm and Design Complexity
Mei 2023 · CRC Press
e-Buku
196
Halaman
family_home
Layak
info
Perihal e-buku ini
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.
Perihal pengarang
Anli Sherine, S. Albert Alexander
Berikan rating untuk e-Buku ini
Beritahu kami pendapat anda.
Maklumat pembacaan
Telefon pintar dan tablet
Pasang apl Google Play Books untuk Android dan iPad/iPhone. Apl ini menyegerak secara automatik dengan akaun anda dan membenarkan anda membaca di dalam atau luar talian, walau di mana jua anda berada.
Komputer riba dan komputer
Anda boleh mendengar buku audio yang dibeli di Google Play menggunakan penyemak imbas web komputer anda.
eReader dan peranti lain
Untuk membaca pada peranti e-dakwat seperti Kobo eReaders, anda perlu memuat turun fail dan memindahkan fail itu ke peranti anda. Sila ikut arahan Pusat Bantuan yang terperinci untuk memindahkan fail ke e-Pembaca yang disokong.
