FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.

 Title Combinatorial Algorithms for Computers and Calculators
 Author(s) Albert Nijenhuis and Herbert S. Wilf
 Publisher: Academic Press, 2 edition (June 1978) eBook(Albert Nijenhuis and Herbert S. Wilf, 2006)
 Paperback 316 pages
 eBook PDF, 5.31 MB
 Language: English
 ISBN10: 0125192606
 ISBN13: 9780125192606
 Share This:
Book Description
This book deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and ksubset of an nset 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.
About the Authors Albert Nijenhuis was a DutchAmerican mathematician who specialized in differential geometry and the theory of deformations in algebra and geometry, and later worked in combinatorics.
 Herbert S. Wilf was a mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania. In 1998 he received the Leroy P. Steele Prize for Seminal Contribution to Research, awarded by the American Mathematical Society, and in 1996 he was awarded the Deborah and Franklin Tepper Haimo Award for Distinguished College or University Teaching of mathematics.




















