Search preferences
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

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 £ 20 (No further results match this refinement)
  • £ 20 to £ 35 (No further results match this refinement)
  • Over £ 35 
Custom price range (£)

Free Shipping

  • Free Shipping to U.S.A. (No further results match this refinement)

Seller Location

  • £ 77.21

    £ 13.46 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.