| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Algebra.Algorithms.Groebner.F4
Description
Faugere's F4 algorithm
Synopsis
- f4' :: (Normed (Coefficient poly), IsOrderedPolynomial poly, Field (Coefficient poly), Matrix mat (Coefficient poly)) => proxy mat -> Ideal poly -> [poly]
- f4 :: (Field (Coefficient poly), Num (Coefficient poly), IsOrderedPolynomial poly, Normed (Coefficient poly)) => Ideal poly -> [poly]
- f4WithStrategy' :: (Normed (Coefficient poly), Ord w, IsOrderedPolynomial poly, Field (Coefficient poly), Matrix mat (Coefficient poly)) => proxy mat -> Strategy poly w -> Ideal poly -> [poly]
- f4WithStrategy :: (Field (Coefficient poly), IsOrderedPolynomial poly, Normed (Coefficient poly), Num (Coefficient poly), Ord w) => Strategy poly w -> Ideal poly -> [poly]
- normalStrategy :: IsOrderedPolynomial poly => poly -> poly -> Int
Documentation
f4' :: (Normed (Coefficient poly), IsOrderedPolynomial poly, Field (Coefficient poly), Matrix mat (Coefficient poly)) => proxy mat -> Ideal poly -> [poly] Source #
f4 :: (Field (Coefficient poly), Num (Coefficient poly), IsOrderedPolynomial poly, Normed (Coefficient poly)) => Ideal poly -> [poly] Source #
f4WithStrategy' :: (Normed (Coefficient poly), Ord w, IsOrderedPolynomial poly, Field (Coefficient poly), Matrix mat (Coefficient poly)) => proxy mat -> Strategy poly w -> Ideal poly -> [poly] Source #
Computes Gröbner Basis for the given ideal by F_4 algorithm, with specified internal representation of matrix.
f4WithStrategy :: (Field (Coefficient poly), IsOrderedPolynomial poly, Normed (Coefficient poly), Num (Coefficient poly), Ord w) => Strategy poly w -> Ideal poly -> [poly] Source #
F_4 algorithm, using parallel array as an internal representation
normalStrategy :: IsOrderedPolynomial poly => poly -> poly -> Int Source #