Buchberger's algorithm (Gröbner Bases Gröbner Bases)
Jump to navigation
Jump to search
Time Complexity
d^{({2}^{(n+o({1})})})
Space Complexity
d^{({2}^{(n+o({1}))})}?? words
(Output may contain that many elements. However, this bound seems very crude/loose)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1976
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/1088216.1088219