Revision as of 01:42, 15 January 2026

(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.

Source: NISTIR 7878 | Category:

Revision as of 00:12, 15 January 2026 view source imported>Unknown user No edit summary		Revision as of 01:42, 15 January 2026 view source imported>Unknown user No edit summary Newer edit →
(No difference)