This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.

From the Back Cover

A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.

"...a very valuable collection of mathematical techniques for the analysis of algorithms..." ― Mathematical Reviews

"The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." ― SIAM Review

"The book presents a welcome selection a

nd careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." ― Computing Reviews

"About this title" may belong to another edition of this title.

Store Description

I mainly carry imported books from South East Asia / South Asia for readers of all Age Groups.

Visit Seller's Storefront

Seller's business information

PLETOS INC
6931 51st Avenue, WOODSIDE, Woodside, NY, 11377, U.S.A.

Sale & Shipping Terms

Terms of Sale

We accept return for those books which are received damamged. Though we take appropriate care in packaing to avoid such situation.

Right of cancellation

Shipping Terms

Shipping rates from U.S.A. to United Kingdom

Shipping rates from U.S.A. to United Kingdom
Order quantity	21 to 36 business days	5 to 8 business days
First item	� 6.74	� 10.86

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.