Hi! Does anybody know which algorithm is used when the command "InterReduce" is envoked? I'm using Maple 12 and I want to interreduce a list of four homogeneous polynomials in 9 unknowns. I thought that "InterReduce" would use the F4 algorithm to reduce the polynomials, but the process does not finish, even after six hours. When I interreduce the polynomials "by hand" using the command "Reduce" everything is finished after 10 minutes. So, the question is, what does "InterReduce"? Which algorithm is used? Thanks a lot!! domo

Hi! I'm using Maple 10 on my Laptop. OS is Fedora 7. I want to compute a Groebnerbasis for the following ideal. the_ideal:=[x3, x2, x1, x0, -1274687*x0^2-890931*x1^2-1178748*x2^2-986870*x3^2+1740*y2*x0-1740*y0*x2-4104*y1*x3+4104*y3*x1-580*sqrt(3)*y3*x0+580*sqrt(3)*y0*x3+1368*sqrt(3)*y2*x1-1368*sqrt(3)*y1*x2+191878*x3*x2*sqrt(3)+12*y2^2+12*y3^2+12*y0^2+12*y1^2, -1740*y2*x0+1740*y0*x2+4104*y1*x3-4104*y3*x1-580*sqrt(3)*y3*x0+580*sqrt(3)*y0*x3+1368*sqrt(3)*y2*x1-1368*sqrt(3)*y1*x2-191878*x3*x2*sqrt(3)-6656903*x0^2-6273147*x1^2-6560964*x2^2-6369086*x3^2+12*y2^2+12*y3^2+12*y0^2+12*y1^2, 1160*sqrt(3)*y3*x0-1160*sqrt(3)*y0*x3-2736*sqrt(3)*y2*x1+2736*sqrt(3)*y1*x2-7282367*x0^2-6898611*x1^2-6898611*x2^2-7282367*x3^2+12*y0^2+12*y1^2+12*y2^2+12*y3^2, k*(x0^2+x1^2+x2^2+x3^2)-1];