Programming Books C Java PHP Python Learn more Browse Programming Books
Qty:1
  • List Price: $199.00
  • Save: $64.67 (32%)
Usually ships within 2 to 5 weeks.
Ships from and sold by Amazon.com.
Gift-wrap available.
+ $3.99 shipping
Used: Good | Details
Sold by thebookgrove
Condition: Used: Good
Comment: May or may not be a library edition. Satisfaction guaranteed. All inquiries answered promptly and courteously.
Access codes and supplements are not guaranteed with used items.
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: $134.33
19 New from $134.33 12 Used from $58.04 1 Collectible from $174.15
Amazon Price New from Used from
Hardcover
"Please retry"
$134.33
$134.33 $58.04
Year-End%20Deals%20in%20Books
NO_CONTENT_IN_FEATURE

Hero Quick Promo
Year-End Kindle Daily Deals
Load your library with great books for $2.99 or less each, today only. Learn more

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: #2,764,248 in Books (See Top 100 in Books)

Important Information

Ingredients
Example Ingredients

Directions
Example Directions

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 Amazonwantsmetouseanalias-okay 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