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: Algorithms for Modular Elliptic CurvesAlgorithms for Modular Elliptic Curves
by - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(13041 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.
(8082 views)
Book cover: Problems on Algorithms, 2nd editionProblems on Algorithms, 2nd edition
by - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(14186 views)
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.
(12059 views)