Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs (Q1036188)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs |
scientific article; zbMATH DE number 5631693
| 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; zbMATH DE number 5631693 |
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
random fractional designs
0 references
resolution
0 references
