- Category: Computer
- Author: Albert Nijenhuis and Herbert S. Wilf
- Pages: 316 pages
- File type: PDF, 5.31 MB
Read and download free eBook intituled Combinatorial Algorithms for Computers and Calculators in format PDF, 5.31 MB – 316 pages created by Albert Nijenhuis and Herbert S. Wilf.
This book deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed.
It can be read at several levels. Those whose only need is to use one of the computer programs can turn immediately to those pages and satisfy their wants. Thus, on one level, this is a collection of subroutines, in FORTRAN, for the solution of combinatorial problems.
This book will be of value to both students and specialists in the fields of applied mathematics and computer science.
Read and Download Links: