Algebraic and SAT models for SCA generation
From MaRDI portal
Cites work
- A Computing Procedure for Quantification Theory
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
- Algebraic techniques for covering arrays and related structures
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Directed t-packings and directed t-Steiner systems
- Generating event-sequence test cases by answer set programming with the incidence matrix
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Introduction to combinatorial testing
- Perfect sequence covering arrays
- Properties of Gröbner bases under specializations
- Sequence covering arrays
- Sequence Covering Arrays and Linear Extensions
- Solving polynomial equation systems. Vol. III: Algebraic solving
- Solving systems of algebraic equations by using Gröbner bases
- Weighted \(t\)-way sequences
This page was built for publication: Algebraic and SAT models for SCA generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025952)