Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05B15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05B20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6699693 / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed covering arrays
Property / zbMATH Keywords: mixed covering arrays / rank
 
Normal rank
Property / zbMATH Keywords
 
super-simple
Property / zbMATH Keywords: super-simple / rank
 
Normal rank
Property / zbMATH Keywords
 
optimum
Property / zbMATH Keywords: optimum / rank
 
Normal rank
Property / zbMATH Keywords
 
detecting arrays
Property / zbMATH Keywords: detecting arrays / rank
 
Normal rank
Property / zbMATH Keywords
 
existence
Property / zbMATH Keywords: existence / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-017-5684-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560082630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Arrays of Index Unity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of a Theorem due to MacNeish / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of strength three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state of strength-three covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strength two covering arrays: existence tables and projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roux-type constructions for covering arrays of strengths three and four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and detecting arrays for interaction faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (\(g\), 4; 1)-difference matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and algorithms for covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compound Orthogonal Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of new orthogonal arrays and covering arrays of strength three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(t\)-covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence between optimal detecting arrays and super-simple OAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal locating arrays for at most two faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum mixed level detecting arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum detecting arrays for independent interaction faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 13 July 2024

scientific article
Language Label Description Also known as
English
Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
scientific article

    Statements

    Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (English)
    0 references
    0 references
    3 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed covering arrays
    0 references
    super-simple
    0 references
    optimum
    0 references
    detecting arrays
    0 references
    existence
    0 references
    0 references