Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$55.05
Qty:1
  • List Price: $57.95
  • Save: $2.90 (5%)
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Trade in your item
Get a $2.00
Gift Card.
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

Algorithms and Complexity Hardcover – December 9, 2002

ISBN-13: 978-1568811789 ISBN-10: 1568811780 Edition: 2nd

Buy New
Price: $55.05
10 New from $52.10 18 Used from $26.10
Amazon Price New from Used from
Hardcover
"Please retry"
$55.05
$52.10 $26.10
Paperback
"Please retry"
$17.60

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Hardcover: 219 pages
  • Publisher: A K Peters/CRC Press; 2 edition (December 9, 2002)
  • Language: English
  • ISBN-10: 1568811780
  • ISBN-13: 978-1568811789
  • Product Dimensions: 9.1 x 5.9 x 0.7 inches
  • Shipping Weight: 15.2 ounces (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #2,508,741 in Books (See Top 100 in Books)

Editorial Reviews

Review

"[The examples] are selected with great care and enable the reader to concentrate directly on the main features of the demonstrated topics. . . . The book can be warmly recommended to those willing to learn (or teach) basic ideas of computational mathematics." -EMS Newsletter, March 2004

About the Author

Herbert S. Wilf is the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania. In 1998 he received the Leroy P. Steele Prize for Seminal Contribution to Research, awarded by the American Mathematical Society, and in 1996 he was awarded the Deborah and Franklin Tepper Haimo Award for Distinguished College or University Teaching of mathematics.

More About the Author

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

Customer Reviews

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

Most Helpful Customer Reviews

7 of 7 people found the following review helpful By Truls A. Bjrklund on October 9, 2005
Format: Hardcover
I have really enjoyed this book. It introduces all the mathematical stuff at the beginning, and draws the clear link between recurrences and differential equations. I find this way of doing things very handy and far surerior to the way famous books on algorithms like Cormen et al. does it. To a fresh student taking his or her first course in algorithms it may be a rough start, but it is definitely an interresting book.
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

Search

What Other Items Do Customers Buy After Viewing This Item?