Abstract
Extending our previous work [7], we introduce a novel technique to model and compute arbitrary strength covering arrays over v-ary alphabets, using methods arising from linear algebra commutative algebra and symbolic computation. Concrete instances of covering arrays for given parameters then appear as points in varieties as they occur in solutions of multivariate polynomial equation systems. To solve these systems we apply polynomial solvers based on the theory of Gröbner bases and exhaustive search using serial and parallel programming techniques.
Author supplied keywords
Cite
CITATION STYLE
Kampel, L., Simos, D. E., Garn, B., Kotsireas, I. S., & Zhereshchin, E. (2019). Algebraic models for arbitrary strength covering arrays over v-ary alphabets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11545 LNCS, pp. 177–189). Springer Verlag. https://doi.org/10.1007/978-3-030-21363-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
