Logo

A=B by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

Large book cover: A=B

A=B
by

Publisher: AK Peters, Ltd.
ISBN/ASIN: 1568810636
ISBN-13: 9781568810638
Number of pages: 217

Description:
This book introduces the idea of hypergeometric function, the Swiss army knife of combinatorial mathematics, and proceeds to develop algorithms for their computation as well as numerous applications. The authors also reveal what, exactly, computers can help us to decide, what is a "closed form" solution, what are "canonical" and "normal" forms, and inject relevant philosophical digressions that keep the discussions lively and entertaining. The authors also present snippets of "Mathematica" code so that you can try out many of the basic operations yourself.

Home page url

Download or read it online for free here:
Download link
(1.2MB, PDF)

Similar books

Book cover: Open Data Structures: An IntroductionOpen Data Structures: An Introduction
by - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(15418 views)
Book cover: Randomized AlgorithmsRandomized Algorithms
by - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(11441 views)
Book cover: Elementary AlgorithmsElementary Algorithms
by - Github
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
(8940 views)
Book cover: Efficient Algorithms for Sorting and SynchronizationEfficient Algorithms for Sorting and Synchronization
by - 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.
(13374 views)