Skip to content
Linear programming over exponent pairs
Haskell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Math
auxiliary
tests
.gitignore
.travis.yml
CHANGELOG.md
LICENSE
README.md
Setup.hs
exp-pairs.cabal
stack.yaml

README.md

exp-pairs Build Status

Package implements an algorithm to minimize the maximum of a list of rational objective functions over the set of exponent pairs. See full description in

A. V. Lelechenko, Linear programming over exponent pairs. Acta Univ. Sapientiae, Inform. 5, No. 2, 271-287 (2013). http://www.acta.sapientia.ro/acta-info/C5-2/info52-7.pdf

A set of useful applications is also included, covering estimates of asymmetric divisor functions and moments of Riemann zeta-function.

You can’t perform that action at this time.