Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930): 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.1007/s10623-017-0369-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2619826047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning of juntas from membership queries / 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: 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: A construction for strength-3 covering arrays from linear feedback shift register sequences / 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: Covering arrays from cyclotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3195092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2927763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3000893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving two recursive constructions for covering arrays / 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: Adaptive versus nonadaptive attribute-efficient learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: $t$-Covering Arrays Generated by a Tiling Probability Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for covering arrays using permutation vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Size of Covering Arrays: An Application of Entropy Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for constructing families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcube fault-tolerance in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of higher strength from permutation vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5300606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved strength four covering arrays with three symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(t\)-covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group construction of covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized post-optimization of covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Size of Covering Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covering arrays: algorithms and asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector sets for exhaustive testing of logic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing new covering arrays from LFSR sequences over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Array Bounds Using Analytical Techniques / rank
 
Normal rank

Latest revision as of 11:26, 15 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic and constructive methods for covering perfect hash families and covering arrays
scientific article

    Statements

    Asymptotic and constructive methods for covering perfect hash families and covering arrays (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    covering array
    0 references
    covering perfect hash family
    0 references
    conditional expectation algorithm
    0 references
    asymptotic bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references