Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets

DOI10.1007/978-3-030-21363-3_15zbMath1434.68341OpenAlexW2952044104MaRDI QIDQ2175421

Bernhard Garn, Evgeny Zhereshchin, Ludwig Kampel, Dimitris E. Simos, Ilias S. Kotsireas

Publication date: 29 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21363-3_15

zbMATH Keywords

algebraic modelscovering arrayssolvers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods

This page was built for publication: Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets