Singular

Hi,

maybe a stupid question: but what is the complexity of the algorithm which interred uses? I would like to avoid the computation of a groebner basis. Can anyone help me out with information? Google did not really yield the corresponding information.

Regards,
pu

interred used to be a preprocessing step of the Buchberger algorithm
(it is now implemented differently).
It simply tries to reduce every lead term by alll the other polynomials
and continues then with the non-leading terms.
That is roughly n*n*m normal form computations
(n: number of polynomials, m: max. length of the polynomials).
And a normal form computation itself may be quite complex.

The result is nota Groebner bases, only a (hopefully) smaller
generating set of the ideal.

Hey guys, I need help finding a search algorithm that would allow me to find the lowest 7 floating-point numbers in an array. The catch is that the array is likely to be about 200 numbers long and that I need to be able to run this search very very quickly. Like on the order of over 300 times per second. Standard search algorithms dont particularly help because they seem to do tons and tons of extra work when I only need the lowest seven elements, and neither do sorting algorithms the list is going to be unsorted most of the time, so I cant simply pull off the top or bottom 7 numbers. Ive already searched through a Knuth book and tried googling it, but I dont really get any hits. Does anyone have any good ideas preferably ones that arent impossible to implement in C/C?