Jump to content

(p, t)-completeness/fr

From Hackerpedia
< (p, t)-completeness
Revision as of 04:13, 16 January 2026 by imported>Admin
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

(p, t)-complétude

Pour un ensemble donné de n variables, (p, t)-exhaustivité est la proportion des combinaisons C(n, t) qui ont une couverture de configuration d'au moins p.

Source: NISTIR 7878 | Category:

en:(p, t)-completeness

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