package polynomial

You can search for identifiers within the package.

in-package search v0.2.0

Polynomials over finite fields

Install

Dune Dependency

gitlab.com Readme Changelog Edit opam file Versions (2)

Authors

D

Danny Willems <be.danny.willems@gmail.com>

Maintainers

D

Danny Willems <be.danny.willems@gmail.com>

Sources

ocaml-polynomial-0.4.0.tar.gz

md5=0ec793314441a5a1106cdf57d1e09304

sha512=1b474604c31c152d0539f912c08fac0c41d61da0ffd27270f37d7121e851ac9cc4f03ca3bb061da266039189a92d4fb50eb0d366ade5814b62cfa03289310515

doc/polynomial/Polynomial/index.html

Module `Polynomial`Source

Sourcetype natural_with_infinity =

| Natural of int
| Infinity

Sourcemodule type UNIVARIATE = sig ... end

Source

val generate_evaluation_domain : 
  (module Ff_sig.PRIME with type t = 'a) ->
  int ->
  'a ->
  'a array

generate_evaluation_domain (module Fp) n generator generates the domain g^{i} to be used in FFT related algorithms. generator must be a n-th principal root of unity in the finite field Fp

Sourcemodule MakeUnivariate (R : Ff_sig.PRIME) : UNIVARIATE with type scalar = R.t

Make(Fp) builds a module of type T where the coefficients are in the prime field Fp