Relation of covering by cosets #
This file defines a predicate for a set to be covered by at most K
cosets of another set.
This is a fundamental relation to study in additive combinatorics.
This file defines a predicate for a set to be covered by at most K
cosets of another set.
This is a fundamental relation to study in additive combinatorics.