The following pages link to MPC (Q19300):
Displaying 15 items.
- A numerical approach to Virasoro blocks and the information paradox (Q1705976) (← links)
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\) (Q2300484) (← links)
- Efficient and accurate implementation of \(hp\)-BEM for the Laplace operator in 2D (Q2349303) (← links)
- Highly accurate calculation of the resonances in the Stark effect in hydrogen (Q2422827) (← links)
- Constructing elliptic curves over finite fields using double eta-quotients (Q2483709) (← links)
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics (Q2829108) (← links)
- Fast evaluation of modular functions using Newton iterations and the AGM (Q3015060) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- Fast Decomposition of Polynomials with Known Galois Group (Q4426704) (← links)
- Computing Jacobi’s theta in quasi-linear time (Q4605708) (← links)
- Computing Hypergeometric Functions Rigorously (Q4960950) (← links)
- Complex Inclusion Functions in the CoStLy C++ Class Library (Q5747900) (← links)
