May 2015
Intermediate to advanced
272 pages
6h 2m
English
A combinatorial problem usually requires enumerating, counting, or ascertaining existence of structures that satisfy a given property
in a set of structures
. We now show that slicing can be used for solving such problems mechanically and efficiently. Specifically, we give an efficient (polynomial time) algorithm to enumerate, count, or detect structures that satisfy
when the total set of structures is large but the set of structures satisfying
is small. We illustrate the slicing method by analyzing problems in integer partitions, set families, and the set of permutations.
Consider the following combinatorial problems:
Read now
Unlock full access