latte-int 1.7.6+ds-3build2 source package in Ubuntu
Changelog
latte-int (1.7.6+ds-3build2) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- William Grant <email address hidden> Mon, 01 Apr 2024 17:49:57 +1100
Upload details
- Uploaded by:
- William Grant
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | misc | |
Noble | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
latte-int_1.7.6+ds.orig.tar.xz | 7.5 MiB | aac5078188f1c6976541e0defbae5c1e4180b1d7bc67c74a7825ee452225d018 |
latte-int_1.7.6+ds-3build2.debian.tar.xz | 11.8 KiB | 57746fae882dab7df480cbb935ed3ac2c96755585a48f73764966e857de00aa5 |
latte-int_1.7.6+ds-3build2.dsc | 2.2 KiB | 2703b7a46860eee15a9ac5e864690d5fe6a48e6ed3f85687ecee3f236ccffba0 |
Available diffs
- diff from 1.7.6+ds-3build1 to 1.7.6+ds-3build2 (318 bytes)
Binary packages built by this source
- latte-int: Lattice point Enumeration
LattE (Lattice point Enumeration) is a computer software dedicated to
the problems of counting lattice points and integration inside convex
polytopes. LattE contains the first ever implementation of Barvinok's
algorithm. The LattE macchiato version (by M. Köppe) incorporated
fundamental improvements and speed ups.
.
Now the latest version, LattE integrale, has the ability to directly
compute integrals of polynomial functions over polytopes and in
particular to do exact volume computations. Version 1.6 adds the
capability of computing the highest coefficients of weighted Ehrhart
quasipolynomials.
.
This package contains the executable and Maple programs.
- latte-int-dbgsym: debug symbols for latte-int
- latte-int-doc: Lattice point Enumeration (documentation and examples)
LattE (Lattice point Enumeration) is a computer software dedicated to
the problems of counting lattice points and integration inside convex
polytopes. LattE contains the first ever implementation of Barvinok's
algorithm. The LattE macchiato version (by M. Köppe) incorporated
fundamental improvements and speed ups.
.
Now the latest version, LattE integrale, has the ability to directly
compute integrals of polynomial functions over polytopes and in
particular to do exact volume computations. Version 1.6 adds the
capability of computing the highest coefficients of weighted Ehrhart
quasipolynomials.
.
This package contains the documentation and examples.