Order Total (1 Item Items):
Shipping Destination:
Algorithm Design Analysis Introduction English by Jia Tong Deng Zhu (1 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (1)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (1)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (1)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (No further results match this refinement)
- Not Print on Demand (1)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
US$ 100.25
Convert currencyUS$ 18.00 shipping from China to U.S.A.Quantity: 1 available
Add to basketpaperback. 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.
