Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs (Q1036188)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs
scientific article

    Statements

    Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs (English)
    0 references
    11 November 2009
    0 references
    0 references
    random fractional designs
    0 references
    resolution
    0 references
    0 references
    0 references