All Questions
Tagged with sat computer-algebra
1 question
2
votes
1
answer
130
views
Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)$
This is based on numerical experiments in sage.
Let $K$ be a ring and define the ideal where each polynomial
is of the form $(a_i x_i+b_i)(a_j x_j+b_j)$ for constant $a_i,b_i,a_j,b_j$.
Q1 Is it true ...
- 25.4k