An Optimal Algorithm for Constructing th
✍
Ulla Koppenhagen; Ernst W. Mayr
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 404 KB
It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper