How to Install and Uninstall libfactory-4_3_1 Package on openSUSE Leap
Last updated: December 27,2024
1. Install "libfactory-4_3_1" package
Please follow the step by step instructions below to install libfactory-4_3_1 on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libfactory-4_3_1
Copied
2. Uninstall "libfactory-4_3_1" package
This is a short guide on how to uninstall libfactory-4_3_1 on openSUSE Leap:
$
sudo zypper remove
libfactory-4_3_1
Copied
3. Information about the libfactory-4_3_1 package on openSUSE Leap
Information for package libfactory-4_3_1:
-----------------------------------------
Repository : Main Repository
Name : libfactory-4_3_1
Version : 4.3.1-bp155.1.5
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.9 MiB
Installed : No
Status : not installed
Source package : singular-4.3.1-bp155.1.5.src
Upstream URL : https://www.singular.uni-kl.de/
Summary : Singular's factorization library
Description :
Factory is a C++ class library that implements a recursive
representation of multivariate polynomial data. Factory handles
sparse multivariate polynomials over different coefficient domains,
such as Z, Q and GF(q), as well as algebraic extensions over Q and
GF(q) in an efficient way. Factory includes algorithms for computing
univariate and multivariate gcds, resultants, chinese remainders, and
several algorithms to factorize univariate polynomials over the
integers and over finite fields.
-----------------------------------------
Repository : Main Repository
Name : libfactory-4_3_1
Version : 4.3.1-bp155.1.5
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.9 MiB
Installed : No
Status : not installed
Source package : singular-4.3.1-bp155.1.5.src
Upstream URL : https://www.singular.uni-kl.de/
Summary : Singular's factorization library
Description :
Factory is a C++ class library that implements a recursive
representation of multivariate polynomial data. Factory handles
sparse multivariate polynomials over different coefficient domains,
such as Z, Q and GF(q), as well as algebraic extensions over Q and
GF(q) in an efficient way. Factory includes algorithms for computing
univariate and multivariate gcds, resultants, chinese remainders, and
several algorithms to factorize univariate polynomials over the
integers and over finite fields.