Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$159.20
Qty:1
  • List Price: $199.00
  • Save: $39.80 (20%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Parameterized Complexity (Monographs in Computer Science) Hardcover – November 6, 1998

ISBN-13: 978-0387948836 ISBN-10: 038794883X Edition: 1999th

Buy New
Price: $159.20
22 New from $81.06 17 Used from $50.00
Amazon Price New from Used from
Hardcover
"Please retry"
$159.20
$81.06 $50.00
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Customers Who Viewed This Item Also Viewed

NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Series: Monographs in Computer Science
  • Hardcover: 533 pages
  • Publisher: Springer; 1999 edition (November 6, 1998)
  • Language: English
  • ISBN-10: 038794883X
  • ISBN-13: 978-0387948836
  • Product Dimensions: 9.5 x 6.4 x 1.2 inches
  • Shipping Weight: 2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #1,854,318 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.0 out of 5 stars
5 star
0
4 star
1
3 star
0
2 star
0
1 star
0
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

8 of 8 people found the following review helpful By William Gasarch on September 5, 2000
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images