Algorithm Design Analysis Introduction by Jia Tong (3 results)

Author
Title
Refine with Advanced Search

Refine your search

  • Books (3)

  • New (3)

to

Custom price range (US$)

to

  • Published by China Press, 2000

    711122504X / 9787111225041

    • Softcover

    Seller: liu xing, Nanjing, JS, Chinaliu xing

    5-star seller
    Contact seller

    Condition: New

    US$ 74.63

    US$ 18.00 shipping 
    Ships from China to U.S.A.

    Quantity: 1 available

    paperback. Condition: New. Paperback Pages Number: 378 Language: Chinese. Book in introducing the algorithm. focuses on stem design algorithm strategy. Very different. The book of pruning the search. sharing analysis of randomized algorithms. online algorithms. and polynomial approximation scheme is relatively new ideas and a number of newly developed algorithm based on sharing analysis. each algorithm with the instance to be introduced. and each example graph explained in detail. In addition. the book provides more th.

  • Published by Machinery Industry Press, 2000

    7111208218 / 9787111208211

    • Softcover

    Seller: liu xing, Nanjing, JS, Chinaliu xing

    5-star seller
    Contact seller

    Condition: New

    US$ 100.25

    US$ 18.00 shipping 
    Ships from China to U.S.A.

    Quantity: 1 available

    paperback. Condition: New. Paperback. Pub Date: 2007 02 Pages: 723 Publisher: Machinery Industry Press communication network design. VLSI layout and DNA sequence analysis. are important. and the difficulty of the problem. the primary algorithms alone can not solve. Therefore. computer scientists. there is a good algorithm design and analysis knowledge system is very important. Book from a strategic point of view to describe the algorithm design. Each policy contains many design algorithm based on this strategy. and for.

  • Condition: New

    US$ 100.25

    US$ 18.00 shipping 
    Ships from China to U.S.A.

    Quantity: 1 available

    Add to basket

    paperback. Condition: 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.