MPC
From MaRDI portal
Software:19300
swMATH7251MaRDI QIDQ19300FDOQ19300
Author name not available (Why is that?)
Cited In (15)
- Efficient and accurate implementation of \(hp\)-BEM for the Laplace operator in 2D
- The complexity of class polynomial computation via floating point approximations
- A numerical approach to Virasoro blocks and the information paradox
- Constructing elliptic curves over finite fields using double eta-quotients
- Fast evaluation of modular functions using Newton iterations and the AGM
- Fast Decomposition of Polynomials with Known Galois Group
- Computing modular polynomials in quasi-linear time
- Computing Jacobi’s theta in quasi-linear time
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Complex Inclusion Functions in the CoStLy C++ Class Library
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\)
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics.
- Computing Hypergeometric Functions Rigorously
- Highly accurate calculation of the resonances in the Stark effect in hydrogen
This page was built for software: MPC
