Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
boundVariables :: forall p. PrimeField (Zp p) => Polynomial p -> [Polynomial p] -> Polynomial p Source #
makeTheorem :: forall p. PrimeField (Zp p) => ArithmeticCircuit (Zp p) -> (Polynomial p, [Polynomial p]) Source #
verify :: forall p. PrimeField (Zp p) => (Polynomial p, [Polynomial p]) -> Bool Source #
groebner :: forall p. PrimeField (Zp p) => [Polynomial p] -> [Polynomial p] Source #
variableTypes :: forall p. Prime p => [Polynomial p] -> [(Monomial p, VarType)] Source #
makeSPoly :: (Eq c, FiniteField c, Ord a, Ring a) => Polynom a c -> Polynom a c -> Polynom a c Source #
fullReduceMany :: (Eq c, FiniteField c, Ord a, Ring a) => Polynom a c -> [Polynom a c] -> Polynom a c Source #