Algebraic Modelling of Covering Arrays

DOI10.1007/978-3-319-56932-1_10zbMath1383.05048OpenAlexW2738047889MaRDI QIDQ4610003

Dimitris E. Simos, Bernhard Garn

Publication date: 5 April 2018

Published in: Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56932-1_10

zbMATH Keywords

algorithmssymbolic computationalgebraic modellingcovering arrays

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

A primer on the application of neural networks to covering array generation ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Algebraic techniques for covering arrays and related structures ⋮ In-parameter-order strategies for covering perfect hash families ⋮ A survey on the problems and algorithms for covering arrays via set covers

Uses Software

• Magma
• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Constraint models for the covering test problem
• Covering arrays from cyclotomy
• Gröbner bases and combinatorics for binary codes
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The Magma algebra system. I: The user language
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Hadamard ideals and Hadamard matrices with two circulant cores
• Families of \(k\)-independent sets
• CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
• Vector sets for exhaustive testing of logic circuits
• An algebraic framework for extending orthogonal designs
• Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification

This page was built for publication: Algebraic Modelling of Covering Arrays