Buchberger's algorithm (Gröbner Bases Gröbner Bases)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/doi/10.1145/1088216.1088219")
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