Package: liblrs2 (0.73-2) [debports]
Links for liblrs2
Debian Resources:
Download Source Package :
Not foundMaintainers:
External Resources:
- Homepage [cgm.cs.mcgill.ca]
Similar packages:
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.
Other Packages Related to liblrs2
|
|
|
|
-
- dep: libc6 (>= 2.7)
- GNU C könyvtár: megosztott könyvtárak
also a virtual package provided by libc6-udeb
-
- dep: libgmp10 (>= 2:6.3.0+dfsg)
- Multiprecision arithmetic library
Download liblrs2
Architecture | Package Size | Installed Size | Files |
---|---|---|---|
ppc64 (unofficial port) | 142.3 kB | 617.0 kB | [list of files] |