I'm wondering about the complexity on Gröbner basis. I think I've heard something about O(2^2^n) or something like that. Is that true?

Please Wait...