Jump to content

(p, t)-completeness

From Hackerpedia
Revision as of 00:24, 20 January 2026 by imported>Unknown user
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Languages: English | Français

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

Retrieved from "https://hackerpedia.org/index.php?title=(p,_t)-completeness&oldid=24034"