Timeline for Complexity of Groebner bases
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2012 at 13:47 | comment | added | Thomas Kahle | Yes true, Everything I talked about is for coefficients in a field. Thanks for the reference, I'll take a look. | |
| Jun 9, 2012 at 13:47 | history | edited | Thomas Kahle | CC BY-SA 3.0 |
clarify that coefficients should be from a field for these results
|
| Jun 9, 2012 at 11:05 | comment | added | user6976 | @Thomas: As far as I understand, this is all about polynomial rings over fields. I found a nice paper Aschenbrenner, Matthias Ideal membership in polynomial rings over the integers. J. Amer. Math. Soc. 17 (2004), no. 2, 407–441, which is about integer polynomials. I think it is more related to my question although the problem considered there is different. It is more like the uniform membership problem considered by Mayr and Meyer. But the "size" in that paper is similar to what I need. | |
| Jun 9, 2012 at 10:09 | history | answered | Thomas Kahle | CC BY-SA 3.0 |