Faugère F4 algorithm (Gröbner Bases Gröbner Bases)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(C(n+D_reg, D_reg)$^{\omega}) where omega is the exponent on matrix multiplication == Space Complexity == $O(C(n+D_{reg}, D_{reg})$^{2})? words (Seems to keep track of a square matrix (for monomials) of size $O(C(n+D_{reg}, D_{reg})^2$)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://linkinghub.elsevier.com/retrieve/...")
Time Complexity
$O(C(n+D_reg, D_reg)$^{\omega}) where omega is the exponent on matrix multiplication
Space Complexity
$O(C(n+D_{reg}, D_{reg})$^{2})? words
(Seems to keep track of a square matrix (for monomials) of size $O(C(n+D_{reg}, D_{reg})^2$))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1999
Reference
https://linkinghub.elsevier.com/retrieve/pii/S0022404999000055