On the state of strength-three covering arrays (Q3150159): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Donald L. Kreher / rank
Normal rank
 
Property / author
 
Property / author: Donald L. Kreher / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AETG / 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.1002/jcd.10002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997203758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717192 / 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: Subquadratic zero-knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfers and intersecting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of strength three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting codes and independent families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications (for search theory and truth functions) of Sperner type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for covering arrays by tabu search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of qualitative independent partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays and intersecting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for transversal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank

Latest revision as of 17:35, 4 June 2024

scientific article
Language Label Description Also known as
English
On the state of strength-three covering arrays
scientific article

    Statements

    On the state of strength-three covering arrays (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    0 references
    covering arrays
    0 references
    software testing
    0 references
    0 references