Da: liu xing, Nanjing, JS, Cina
EUR 90,64
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: New. Pub Date :2007-02-01 Publisher: China Machine Press book clearly describes two concepts: PTAS and NPO-complete. In addition. Chapter 12 of this book online algorithms. Contents: PrefaceList of FiguresChapter 1 INTRODUCTIONChapter 2 THE COMPLEXITY OF ALGORITHMS AND THE LOWER BOUNDS OF PROBLEMS 2-1 The time complexity of an algorithm 2-2 The best-. Average-and worst-case analysis of algorithms 2-3 The lower bound of a problem 2-4 The worst-case lower bound of sorting 2-5 Heap sort: A sorting al.