Description: Theory of Computational Complexity Du, Ding-Zhu and Ker-I Ko New York, NY: John Wiley & Sons, 2000. Hardcover, no dust jacket, 491 pages. 8vo Very good condition: Book is gently used with only minor wear. Tightly bound copy with clean interior having no markings, writing, underlining, or highlighting in margins or text block.
Price: 23.99 USD
Location: Huntington Beach, California
End Time: 2024-11-21T20:43:03.000Z
Shipping Cost: 5.38 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Number of Pages: 512 Pages
Publication Name: Theory of Computational Complexity
Language: English
Publisher: Wiley & Sons, Incorporated, John
Item Height: 1.4 in
Publication Year: 2000
Subject: Machine Theory, Discrete Mathematics
Type: Textbook
Item Weight: 30.6 Oz
Author: Ker-I Ko, Ding-Zhu Du
Item Length: 9.3 in
Subject Area: Mathematics, Computers
Series: Wiley Series in Discrete Mathematics and Optimization Ser.
Item Width: 6.5 in
Format: Hardcover
