×

Found 11 Documents (Results 1–11)

100
MathJax

Enumerative combinatorics. Vol. 1. 2nd ed. (English) Zbl 1247.05003

Cambridge Studies in Advanced Mathematics 49. Cambridge: Cambridge University Press (ISBN 978-1-107-60262-5/pbk; 978-1-107-01542-5/hbk; 978-1-139-20056-1/ebook). xiii, 626 p. (2012).
PDF BibTeX XML Cite
Full Text: Link

The art of computer programming. Vol. 4, Fasc. 0–4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks & techniques, binary decision diagrams. Fascicle 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation. Fascicle 0: 3rd printing 2009; Fascicle 1: 1st printing 2009; Fascicle 2: 2nd printing 2009; Fascicle 3: 2nd printing 2009; Fascicle 4: 3rd printing 2009. (English) Zbl 1178.68372

Upper Saddle River, NJ: Addison-Wesley (ISBN 978-0-3216-3713-0/pbk/set; 978-0-321-53496-5/Fasc. 0; 978-0-321-58050-4/Fasc. 1; 978-0-201-85393-3/Fasc. 2; 978-0-201-85394-0/Fasc. 3; 978-0-321-33570-8/Fasc. 4). Fasc. 0, xii, 216 p.; Fasc. 1, viii, 260 p.; Fasc. 2, v, 129 p.; Fasc. 3, iv, 150 p.; Fasc. 4, vi, 120 p. (2009).
PDF BibTeX XML Cite

Enumerative combinatorics. Vol. 1. With a foreword by Gian-Carlo Rota. Corrected reprint of the 1986 hardback edition. (English) Zbl 0945.05006

Cambridge Studies in Advanced Mathematics. 49. Cambridge: Cambridge University Press. xi, 326 p. (1999).
PDF BibTeX XML Cite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Classification

Software