TERM

(p, t)-completeness

For a given set of n variables, (p, t)-completeness is the proportion of the C(n, t) combinations that have configuration coverage of at least p.

Updated

Jan 05, 2026

Senses

Sense 1

For a given set of n variables, (p, t) completeness is the proportion of the C(n, t) combinations that have configuration coverage of at least p.

For a given set of n variables, (p, t)-completeness is the proportion of the C(n, t) combinations that have configuration coverage of at least p.

Bibliography