136691-Thumbnail Image.png
Description

Covering subsequences with sets of permutations arises in many applications, including event-sequence testing. Given a set of subsequences to cover, one is often interested in knowing the fewest number of permutations required to cover each subsequence, and in finding an

Covering subsequences with sets of permutations arises in many applications, including event-sequence testing. Given a set of subsequences to cover, one is often interested in knowing the fewest number of permutations required to cover each subsequence, and in finding an explicit construction of such a set of permutations that has size close to or equal to the minimum possible.

359.54 KB application/pdf

Download restricted. Please sign in.

Download count: 0

Details

Contributors
Date Created
2014-12
Resource Type
  • Text
  • Machine-readable links