Skip to Main Content
The Art of Computer Programming, Volume 4B: Combinatorial Algorithms
book

The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

by Donald E. Knuth
September 2022
Intermediate to advanced content levelIntermediate to advanced
736 pages
30h 14m
English
Addison-Wesley Professional
Content preview from The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

Appendix B—Index to Notations

In the following formulas, letters that are not further qualified have the following significance:

j, k

integer-valued arithmetic expression

m, n

nonnegative integer-valued arithmetic expression

p, q

binary-valued arithmetic expression (0 or 1)

x, y

real-valued arithmetic expression

z

complex-valued arithmetic expression

f

integer-valued, real-valued, or complex-valued function

G, H

graph

S, T

set or multiset

F, G

family of sets

u, v

vertex of a graph

α, β

string of symbols

The place of definition is either a page number in the present volume or a section number in another volume. Many other notations, such as Kn for the complete graph on n vertices, appear in the main index at the close ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

Donald E. Knuth

Publisher Resources

ISBN: 9780137926862