Timeline for Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9 at 12:32 | vote | accept | joro | ||
| Feb 2 at 18:18 | answer | added | Dima Pasechnik | timeline score: 2 | |
| Feb 2 at 11:59 | history | edited | joro | CC BY-SA 4.0 |
solved on the sage-devel mailing list by Dima Pasechnik
|
| Jan 31 at 8:03 | comment | added | Loïc Teyssier | Sorry, yes, I missed the point of only 2 factors. | |
| Jan 31 at 5:19 | comment | added | joro | @LoïcTeyssier You can't add dummy variables, because this will increase the variables from 2 to more and in addition this will break my structure. Observe that groebner basis of random degree 2 polynomials is not efficient according to my tests. | |
| Jan 30 at 19:12 | comment | added | Daniel Weber | @LoïcTeyssier each equation only has two variables. How can you add dummy variables? You can't just have $d=x_1 x_2$, for example | |
| Jan 30 at 17:31 | comment | added | Loïc Teyssier | It looks like you are considering degree-2 algebraic systems, but (up to add dummy variables) any algebraic system has degree 2. So (for general $K$) it shouldn't be easier to solve than your favorite arbitrary system. Or am I missing something (I'm more used to complete char-0 fields, so I probably am) ? | |
| Jan 30 at 16:26 | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| Jan 30 at 15:05 | history | asked | joro | CC BY-SA 4.0 |