How to Install and Uninstall liblrs-dev Package on Kali Linux
Last updated: November 26,2024
1. Install "liblrs-dev" package
This guide let you learn how to install liblrs-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
liblrs-dev
Copied
2. Uninstall "liblrs-dev" package
Here is a brief guide to show you how to uninstall liblrs-dev on Kali Linux:
$
sudo apt remove
liblrs-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the liblrs-dev package on Kali Linux
Package: liblrs-dev
Source: lrslib
Version: 0.71b-2
Installed-Size: 81
Maintainer: David Bremner
Architecture: amd64
Replaces: liblrsgmp-dev (<< 0.70)
Depends: liblrs1 (= 0.71b-2)
Breaks: liblrsgmp-dev (<< 0.70)
Size: 15884
SHA256: 7ef1e69e61e337327990712d2c3abc8114cc2efb9d25b0b12a9ab33f9c8ffb16
SHA1: 4433615f8166abd2541a33dcb41911f8530541dd
MD5sum: b938caa01a5e9a27f3a610d239abe5f3
Description: 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.
Description-md5:
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/l/lrslib/liblrs-dev_0.71b-2_amd64.deb
Source: lrslib
Version: 0.71b-2
Installed-Size: 81
Maintainer: David Bremner
Architecture: amd64
Replaces: liblrsgmp-dev (<< 0.70)
Depends: liblrs1 (= 0.71b-2)
Breaks: liblrsgmp-dev (<< 0.70)
Size: 15884
SHA256: 7ef1e69e61e337327990712d2c3abc8114cc2efb9d25b0b12a9ab33f9c8ffb16
SHA1: 4433615f8166abd2541a33dcb41911f8530541dd
MD5sum: b938caa01a5e9a27f3a610d239abe5f3
Description: 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.
Description-md5:
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/l/lrslib/liblrs-dev_0.71b-2_amd64.deb