lrslib 0.71b-2.1build2 source package in Ubuntu
Changelog
lrslib (0.71b-2.1build2) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 19:59:42 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | math | |
| Noble | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| lrslib_0.71b.orig.tar.gz | 455.8 KiB | df22682cd742315fe04f866cfe4804d5950f7dc7f514d5b5f36f5b7f5aff9188 |
| lrslib_0.71b-2.1build2.debian.tar.xz | 15.0 KiB | 0f6a9864a5827ca78a14b1f6197bbb5180fdbd8b5eb14da3a149bfa9aea37867 |
| lrslib_0.71b-2.1build2.dsc | 2.1 KiB | 0a0f4248c87ef15efbeb427407906d648813da04af2e28fd02c813e728f804ba |
Available diffs
- diff from 0.71b-2.1build1 to 0.71b-2.1build2 (312 bytes)
Binary packages built by this source
- liblrs-dev: package to enumerate vertices and extreme rays (development file)
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
.
This package contains the optional headers, and a unversioned symlink
to the library, useful for developers.
- liblrs1t64: package to enumerate vertices and extreme rays (shared libraries)
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
.
This package contains the (required) shared library.
- liblrs1t64-dbgsym: debug symbols for liblrs1t64
- lrslib: package to enumerate vertices and extreme rays of a convex polyhedron
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
- lrslib-dbgsym: debug symbols for lrslib
- mplrs: package to enumerate vertices and extreme rays of a convex polyhedron (parallel binary)
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
.
This package contains the parallel binary mplrs for use with mpi
- mplrs-dbgsym: debug symbols for mplrs
