How to Install and Uninstall ntl.i686 Package on Fedora 38

Last updated: November 28,2024

1. Install "ntl.i686" package

In this section, we are going to explain the necessary steps to install ntl.i686 on Fedora 38


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                ntl.i686
            
                    
    
    Copied

2. Uninstall "ntl.i686" package

Please follow the step by step instructions below to uninstall ntl.i686 on Fedora 38:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                ntl.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the ntl.i686 package on Fedora 38

Last metadata expiration check: 5:30:57 ago on Sat Mar 16 16:59:57 2024.
Available Packages
Name : ntl
Version : 11.5.1
Release : 5.fc38
Architecture : i686
Size : 962 k
Source : ntl-11.5.1-5.fc38.src.rpm
Repository : fedora
Summary : High-performance algorithms for vectors, matrices, and polynomials
URL : https://libntl.org/
License : LGPL-2.1-or-later AND BSD-2-Clause
Description : NTL is a high-performance, portable C++ library providing data structures
: and algorithms for arbitrary length integers; for vectors, matrices, and
: polynomials over the integers and over finite fields; and for arbitrary
: precision floating point arithmetic.
:
: NTL provides high quality implementations of state-of-the-art algorithms for:
: * arbitrary length integer arithmetic and arbitrary precision floating point
: arithmetic;
: * polynomial arithmetic over the integers and finite fields including basic
: arithmetic, polynomial factorization, irreducibility testing, computation
: of minimal polynomials, traces, norms, and more;
: * lattice basis reduction, including very robust and fast implementations of
: Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new
: Schnorr-Horner pruning heuristic for block Korkin-Zolotarev;
: * basic linear algebra over the integers, finite fields, and arbitrary
: precision floating point numbers.