I have a set of non-linear
equations over a prime field.
I want to solve them using
Groebner basis technique.

When I want to calculate
Groebner basis, I have following error.


verbose 0 (3292: multi_polynomial_ideal.py, groebner_basis) Warning:
falling back to very slow toy implementation.



P1=next_prime(2^100)
R.<x,y,z>=GF(P1)[]
M=[x-2,x^2+y^2-1]
I=M*R
B=I.groebner_basis()

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to 
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.


Reply via email to