✦ LIBER ✦

Combinatorial Algorithms for Computers and Calculators.by Albert Nijenhuis; Herbert S. Wilf

✍ Scribed by Review by: Earl Glen Whitehead, Jr.

Book ID: 124939371
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Tongue: English
Weight: 299 KB
Volume: 22
Category: Article
ISSN: 0036-1445
DOI: 10.2307/2029977

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial algorithms for computers a

Combinatorial algorithms for computers and calculators

✍ Albert Nijenhuis 📂 Library 📅 1978 🏛 Academic Press 🌐 English ⚖ 2 MB

This book 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.At the other extreme, pur

Combinatorial algorithms for computers a

Combinatorial algorithms for computers and calculators

✍ Albert Nijenhuis 📂 Library 📅 1978 🏛 Academic Press 🌐 English ⚖ 1 MB

Combinatorial algorithms for computers a

Combinatorial algorithms for computers and calculators

✍ Albert Nijenhuis 📂 Library 📅 1978 🏛 Academic Press 🌐 English ⚖ 2 MB

Combinatorial algorithms: A. Nijenhuis a

Combinatorial algorithms: A. Nijenhuis and H. S. Wilf, Academic Press, 1975, 253 pp.

✍ Gian-Carlo Rota 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 25 KB

Combinatorial Algorithms (An Update) ||

✍ Wilf, Herbert S. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics ⚖ 206 KB

Combinatorial algorithms: an update

✍ Herbert S. Wilf 📂 Library 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 403 KB

This monograph is a survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled gr