O'Reilly logo

Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1 by Donald E. Knuth

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

f-vectors, see Size vectors.

f : Closure of family f, 277.

f: Maximal elements of family f, 276, 717.

f : Minimal elements of family f, 276, 717.

f : Minimal hitting sets of family f, 276, 671, 674.

fπ: f with variables permuted by π, 236237, 266.

fC (family of complements), 276.

fD (dual of f), 266, 271, 621, 653, 669.

fR (reflection of f), 266, 647.

fZ (x1, . . .,xn) (Z-transform of f), 272.

Factorial number system, 500, 703.

Factorial ruler function, 348.

Factorials, tables of, 499, 512.

Factorization of a graph, 28.

Factorization of an n-cycle, 476.

Factorization of strings, 317.

algorithm for, 700.

Factorizations of an integer, 505, 513.

Failing units, 80.

Faloutsos, Christos (), 681.

FALSE, 202.

Falsehood (), 49, 63, 79.

Families ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required