Complexity Theory of Real Functions (Progress in Theoretical Computer Science)

By K. Ko

Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0817635866
• ISBN13: 9780817635862
• Release Date: October 1991
• Publisher: Birkhäuser
• Length: 310 Pages
• Weight: 1.35 lbs.
• Dimensions: 9.8" x 0.8" x 6.5"