Improving two recursive constructions for covering arrays (Q2322060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/15598608.2012.647489 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011798520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequence approach to linear perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric constructions of optimal linear perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear perfect hash families with small parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hash families: Probabilistic methods and explicit constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear perfect hash families / 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: Constructing strength three covering arrays with augmented annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5327064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and radius-covering arrays: constructions and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear hash families and forbidden configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive construction for perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of mixed covering arrays of strength two / 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: Q3000893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and algorithms for covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(t\)-covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions for perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Postoptimization of Covering Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Exhaustive Pattern Generation for Logic Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hash Families: Constructions and Existence / rank
 
Normal rank

Latest revision as of 07:49, 20 July 2024

scientific article
Language Label Description Also known as
English
Improving two recursive constructions for covering arrays
scientific article

    Statements

    Improving two recursive constructions for covering arrays (English)
    0 references
    0 references
    0 references
    27 August 2019
    0 references
    0 references
    covering array
    0 references
    distributing hash family
    0 references
    heterogeneous hash family
    0 references
    perfect hash family
    0 references
    0 references