Algorithms and Complexity
by Herbert S. Wilf
Publisher: AK Peters, Ltd. 1994
ISBN/ASIN: 1568811780
ISBN-13: 9781568811789
Number of pages: 139
Description:
This is an introductory textbook, suitable for classroom use, on the design and analysis of algorithms, complexity, methods for solving problems on computers and the costs (usually in running time) of using those methods.
Download or read it online for free here:
Download link
(0.8MB, PDF)
Similar books
Efficient Algorithms for Sorting and Synchronizationby Andrew Tridgell - samba.org
This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
(13615 views)
A=Bby Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(26546 views)
Algorithmsby Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(13111 views)
Algorithmsby Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(15615 views)