4 of 4 people found the following review helpful:
5.0 out of 5 stars
This is an important book in complexity theory., February 8, 1999
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.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
0 of 6 people found the following review helpful:
1.0 out of 5 stars
Bad, December 4, 1996
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
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No