DeepRead
Cover of Combinatorial Algorithms

Combinatorial Algorithms

Herbert S. Wilf · 1989

Programming and computer science › Algorithms and coding interviews

#13,208 most recommended

About the book

Algorithms for generating, listing, ranking, and counting combinatorial objects such as permutations, subsets, compositions, partitions, and Gray codes. It is a short monograph from the SIAM regional conference series, written as an update to the author's earlier work on the same field. The central claim is that many combinatorial enumeration problems can be solved by systematic methods that exploit recursive structure, so that each object is produced exactly once and in a defined order. The text presents ranking and unranking as the means to move between objects and integers, and treats backtracking and minimal-change orderings as tools whose efficiency can be analysed. Its main emphasis is on algorithms with provable complexity bounds rather than on heuristics.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420202021202220232020 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1989
ISBN
9781611970166
Editions known
4 at Open Library
Open Library
OL38054750W

Explore in the mosaic

Read next: its neighbours on the mosaic