Content deleted Content added
m dab Syzygy (mathematics) |
m mv refs down |
||
Line 18:
Further methods for computing Gröbner bases include the [[Faugère F4 algorithm]], based on the same mathematics as the Buchberger algorithm, and involutive approaches, based on ideas from [[Differential algebra]].
==See also==▼
* [[Quine-McCluskey algorithm]] (analogous algorithm for Boolean algebra)▼
==References==
Line 37 ⟶ 40:
* David Cox, John Little, and Donal O'Shea (1997). ''Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra'', Springer. ISBN 0-387-94680-2.
* Vladimir P. Gerdt, Yuri A. Blinkov (1998). ''Involutive Bases of Polynomial Ideals'', Mathematics and Computers in Simluation, 45:519ff
▲==See also==
▲* [[Quine-McCluskey algorithm]] (analogous algorithm for Boolean algebra)
==External links==
| |||