Group :: Ciências/Matemática
RPM: ntl
Navegação
Principal Changelog Spec Patches Sources Download Gear Bugs e FR Repocop
A versão atual: 11.5.1-alt1.1
Data da compilação: 18 janeiro 2022, 11:14 ( 118.4 weeks ago )
Tamanho:: 2.22 Mb
Home page: https://libntl.org/
Licença: LGPL-2.0+
Sumário: High-performance algorithms for vectors, matrices, and polynomials
Descrição:
Lista dos contribuidores Lista dos rpms provida por esta srpm:
ACL:
Data da compilação: 18 janeiro 2022, 11:14 ( 118.4 weeks ago )
Tamanho:: 2.22 Mb
Home page: https://libntl.org/
Licença: LGPL-2.0+
Sumário: High-performance algorithms for vectors, matrices, and polynomials
Descrição:
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.
Mantenedor currente: Ilya Kurdyukov 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.
Lista dos contribuidores Lista dos rpms provida por esta srpm:
- libntl-devel
- libntl44
- libntl44-debuginfo