<< 1 >>
Rating: 
Summary: A NEW way to look at Complexity
Review: Many NP-complete problems are solvable in very good time if one of the parameters is bounded. This book investigates this phenomenon. Over half of the book is about ALGORITHMS to SOLVE NP-complete problems FAST if one of the parameters is bounded. THis should be of interest to ALL computer scientists, not just theorists. The rest of the book is about ways to proof problems are NOT of this type, and misc other stuff. This last half is of interest to theorists but not really to anyone else.The book is well written and gives insight into a new and interesting way of looking at Complexity Theory which has practical importance.
Rating:
Summary: A NEW way to look at Complexity
Review: Many NP-complete problems are solvable in very good time if one of the parameters is bounded. This book investigates this phenomenon. Over half of the book is about ALGORITHMS to SOLVE NP-complete problems FAST if one of the parameters is bounded. THis should be of interest to ALL computer scientists, not just theorists. The rest of the book is about ways to proof problems are NOT of this type, and misc other stuff. This last half is of interest to theorists but not really to anyone else. The book is well written and gives insight into a new and interesting way of looking at Complexity Theory which has practical importance.
<< 1 >>
| 
