cafast: Fast Companions to the 'CAs' Package for Covering Arrays
Compiled implementations and generalizations of selected
functions of the 'CAs' package by Ulrike Groemping for covering
arrays. The package provides a C version of the search for the
largest set of rows that can be made constant by permuting symbols,
the power construction of Colbourn and Torres-Jimenez (2010)
<doi:10.1090/conm/523/10309> for any strength, number of columns and
number of levels, a counting kernel that tabulates value tuples for
every set of t columns, and fast versions of the flexible-value tools
and of the randomized post-optimization of Nayeri, Colbourn and
Konjevod (2013) <doi:10.1016/j.ejc.2012.07.017>. Each function was
tested against its 'CAs' counterpart, and the remaining differences
are documented.
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=cafast
to link to this page.