Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.

Parameterized Complexity (Monographs in Computer Science) 1999th Edition

4 out of 5 stars 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 On clicking this link, a new layer will be open
$65.00 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$229.00 On clicking this link, a new layer will be open
More Buying Choices
12 New from $167.32 16 Used from $50.00
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Save Up to 90% on Textbooks Textbooks
$229.00 FREE Shipping. Only 1 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Editorial Reviews

About the Author

Rod Downey is Professor of Mathematics at Victoria University of Wellington, New Zealand. His main research interests lie in algebra, logic and complexity theory. Downey has received many professional accolades throughout his career, including the Schoenfeld Prize of the Association for Symbolic Logic and the Hector Medal of the Royal Society of New Zealand, along with numerous fellowships to learned societies and institutes such as the Isaac Newton Institute (Cambridge) and the American Mathematical Society.
NO_CONTENT_IN_FEATURE



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: #4,240,629 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

Top Customer Reviews

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 8 of 8 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Parameterized Complexity (Monographs in Computer Science)
This item: Parameterized Complexity (Monographs in Computer Science)
Price: $229.00
Ships from and sold by Amazon.com