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 and ComplexityAlgorithms and Complexity
by - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
(21022 views)
Book cover: Tabu SearchTabu Search
by - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(13887 views)
Book cover: AlgorithmsAlgorithms
by - 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.
(12805 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(11646 views)