toysolver-0.8.1: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc
Copyright(c) Masahiro Sakai 2012-2013
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable
Safe HaskellSafe-Inferred
LanguageHaskell2010
Extensions
  • ScopedTypeVariables
  • BangPatterns
  • TypeSynonymInstances
  • FlexibleInstances
  • ExplicitForAll

ToySolver.Data.Polynomial.Factorization.FiniteField

Description

Factoriation of polynomial over a finite field.

References:

Synopsis

Documentation

factor :: forall k. (Ord k, FiniteField k) => UPolynomial k -> [(UPolynomial k, Integer)] Source #

sqfree :: forall k. (Eq k, FiniteField k) => UPolynomial k -> [(UPolynomial k, Integer)] Source #

Square-free decomposition of univariate polynomials over a finite field.

berlekamp :: forall k. (Eq k, Ord k, FiniteField k) => UPolynomial k -> [UPolynomial k] Source #

Berlekamp algorithm for polynomial factorization.

Input polynomial is assumed to be monic and square-free.

basisOfBerlekampSubalgebra :: forall k. (Ord k, FiniteField k) => UPolynomial k -> [UPolynomial k] Source #

Orphan instances