How to Install and Uninstall liblrs1 Package on Kali Linux
Last updated: November 21,2024
1. Install "liblrs1" package
Learn how to install liblrs1 on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
liblrs1
Copied
2. Uninstall "liblrs1" package
Learn how to uninstall liblrs1 on Kali Linux:
$
sudo apt remove
liblrs1
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the liblrs1 package on Kali Linux
Package: liblrs1
Source: lrslib
Version: 0.71b-2
Installed-Size: 307
Maintainer: David Bremner
Architecture: amd64
Depends: libc6 (>= 2.14), libgmp10 (>= 2:6.2.1+dfsg)
Size: 100056
SHA256: 9c15ba66ed7dbd660a9cb44fe7578f5736daa51da42cd9857c77bf8ce9370b31
SHA1: eb2befc0ab99c10aef3b73e68e4619ae104892dc
MD5sum: a94237c2caa62306150f603452e66e9f
Description: 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.
Description-md5:
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Section: math
Priority: optional
Filename: pool/main/l/lrslib/liblrs1_0.71b-2_amd64.deb
Source: lrslib
Version: 0.71b-2
Installed-Size: 307
Maintainer: David Bremner
Architecture: amd64
Depends: libc6 (>= 2.14), libgmp10 (>= 2:6.2.1+dfsg)
Size: 100056
SHA256: 9c15ba66ed7dbd660a9cb44fe7578f5736daa51da42cd9857c77bf8ce9370b31
SHA1: eb2befc0ab99c10aef3b73e68e4619ae104892dc
MD5sum: a94237c2caa62306150f603452e66e9f
Description: 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.
Description-md5:
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Section: math
Priority: optional
Filename: pool/main/l/lrslib/liblrs1_0.71b-2_amd64.deb