How to Install and Uninstall ntl.x86_64 Package on Fedora 39

Last updated: December 12,2024

1. Install "ntl.x86_64" package

Please follow the step by step instructions below to install ntl.x86_64 on Fedora 39


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                ntl.x86_64
            
                    
    
    Copied

2. Uninstall "ntl.x86_64" package

Please follow the guidelines below to uninstall ntl.x86_64 on Fedora 39:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                ntl.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the ntl.x86_64 package on Fedora 39

Last metadata expiration check: 3:03:53 ago on Thu Mar 7 11:44:58 2024.
Available Packages
Name : ntl
Version : 11.5.1
Release : 7.fc39
Architecture : x86_64
Size : 903 k
Source : ntl-11.5.1-7.fc39.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.