Combinatorial Algorithms for Computers and Calculators
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Document Information
| Document Title | Combinatorial Algorithms for Computers and Calculators |
|---|---|
| Author / Organization | Albert Nijenhuis and Herbert S. Wilf |
| Subject & Discipline | Data Structures and Algorithms, Combinatorics and Game Theory, Fortran Programming Language, Computational Complexity |
| Publication Year | 1978 |
| ISBN | 0125192606 |
| Resource Verification | External Reading Page / Repository |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-259120 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Combinatorial Algorithms for Computers and Calculators • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.