The following pages link to Newton's method and FFT trading (Q979146):
Displaying 11 items.
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Computing with D-algebraic power series (Q669617) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability (Q6043379) (← links)
