Industrial-Sized Deals TextBTS15 Shop Men's Hightops Learn more nav_sap_plcc_6M_fly_beacon Cecile McLorin Salvant UP3 $5 Off Fire TV Stick Labor Day Sale in Wine Shop Popular Services hog hog hog  Amazon Echo Starting at $99 Kindle Voyage Shop Back to School with Amazon Back to School with Amazon Outdoor Recreation Baby Sale

Parameterized Complexity (Monographs in Computer Science) 1999th Edition

1 customer review
ISBN-13: 978-0387948836
ISBN-10: 038794883X
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
$131.00
Buy new
$174.28
More Buying Choices
25 New from $149.76 16 Used from $125.00
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


InterDesign Brand Store Awareness Rent Textbooks
$174.28 FREE Shipping. Usually ships within 1 to 4 weeks. Ships from and sold by Amazon.com. Gift-wrap available.

NO_CONTENT_IN_FEATURE


Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

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: 6.1 x 1.2 x 9.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: #3,766,383 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

5 star
0%
4 star
100%
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 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
Want to discover more products? Check out this page to see more: mathematical logic