modpn

swMATH6759MaRDI QIDQ18834FDOQ18834

Author name not available (Why is that?)

Described by source

• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}

Cited In (13)

• Automatic parallel library generation for general-size modular FFT algorithms
• Solving bivariate systems using rational univariate representations
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
• CUMODP
• Separating linear forms and rational univariate representations of bivariate systems
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Computing cylindrical algebraic decomposition via triangular decomposition
• Solving bivariate polynomial systems on a GPU
• The basic polynomial algebra subprograms
• Computations modulo regular chains
• Improved algorithm for computing separating linear forms for bivariate systems
• Bivariate triangular decompositions in the presence of asymptotes
• Basic polynomial algebra subprograms

This page was built for software: modpn