Languages: English | Français
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.
Source: NISTIR 7878 | Category:
