FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||
Product Details
Would you like to update product info or give feedback on images?
|
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
4 of 4 people found the following review helpful:
5.0 out of 5 stars
This is an important book in complexity theory.,
By A Customer
This review is from: Complexity Theory of Real Functions (Progress in Theoretical Computer Science) (Hardcover)
This is an important book in complexity theory. It ties the discrete complexity theory of NP-completeness with numerical computation of continuous functions. Traditionally, numerical computation uses floating-point machines as the computational model and the theory is very messy. More recently, there are several approaches trying to create a more coherent theory with discrete complexity theory. This theory using Turing machines as a model is one of them. The advantage of this approach is that it makes a direct connection with the NP-completeness theory. The book is well-written and includes a brief review of discrete complexity theory.
0 of 6 people found the following review helpful:
1.0 out of 5 stars
Bad,
By A Customer
This review is from: Complexity Theory of Real Functions (Progress in Theoretical Computer Science) (Hardcover)
I think it was the worst book ever. Don't understand why he wrote it
Share your thoughts with other customers: Create your own review
|
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
