[ nabia ]
[ Källkod: lrslib ]
Paket: liblrs0 (0.70-3)
Länkar för liblrs0
Trisquelresurser:
Hämta källkodspaketet lrslib:
Ansvarig:
Original Maintainer:
- David Bremner
Externa resurser:
- Hemsida [cgm.cs.mcgill.ca]
Liknande paket:
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.
Andra paket besläktade med liblrs0
|
|
|
-
- dep: libc6 (>= 2.11) [armhf]
- GNU C Library: Shared libraries
också ett virtuellt paket som tillhandahålls av libc6-udeb
- dep: libc6 (>= 2.14) [amd64]
-
- dep: libgmp10
- Multiprecision arithmetic library
Hämta liblrs0
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| amd64 | 85,0 kbyte | 263 kbyte | [filförteckning] |
| armhf | 60,7 kbyte | 130 kbyte | [filförteckning] |