Hackage :: [Package]

exp-pairs: Linear programming over exponent pairs

[ gpl, library, math ] [ Propose Tags ] [ Report a vulnerability ]

Package implements an algorithm to minimize rational objective function over the set of exponent pairs

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.1.4.1, 0.1.5.0, 0.1.5.1, 0.1.5.2, 0.1.6.0, 0.2.0.0, 0.2.1.0, 0.2.1.1
Change log CHANGELOG.md
Dependencies base (>=4.11 && <5), containers (<0.8), deepseq (>=1.3 && <1.6), ghc-prim (<1), prettyprinter (>=1.7 && <1.8) [details]
Tested with ghc ==8.4.4, ghc ==8.6.5, ghc ==8.8.4, ghc ==8.10.7, ghc ==9.0.2, ghc ==9.2.8, ghc ==9.4.8, ghc ==9.6.6, ghc ==9.8.4, ghc ==9.10.1, ghc ==9.12.1
License GPL-3.0-only
Author Andrew Lelechenko
Maintainer andrew.lelechenko@gmail.com
Category Math
Home page https://github.com/Bodigrim/exp-pairs
Source repo head: git clone https://github.com/Bodigrim/exp-pairs.git
Uploaded by Bodigrim at 2024-12-11T23:12:24Z
Distributions LTSHaskell:0.2.1.1, NixOS:0.2.1.0, Stackage:0.2.1.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 8605 total (43 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-12-12 [all 1 reports]

Readme for exp-pairs-0.2.1.1

[back to package description]

exp-pairs Hackage Stackage LTS Stackage Nightly

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.