The following pages link to Mathemagix (Q13308):
Displaying 39 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
- Even faster integer multiplication (Q306687) (← links)
- A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
- On the isotopic meshing of an algebraic implicit surface (Q414623) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Formal solutions of completely integrable Pfaffian systems with normal crossings (Q504412) (← links)
- Meta-expansion of transseries (Q629344) (← links)
- Computations with effective real numbers (Q817859) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- On asymptotic extrapolation (Q1023265) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Exact \(p\)-adic computation in Magma (Q2229728) (← links)
- Analytic form of the planar two-loop five-parton scattering amplitudes in QCD (Q2315718) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
- Efficient accelero-summation of holonomic functions (Q2457428) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings (Q2638151) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms (Q2819758) (← links)
- Fast Polynomial Multiplication over F <sub>2</sub> <sub>60</sub> (Q2985835) (← links)
- Collaborative Computer Algebra (Q4610016) (← links)
- Implementing Fast Carryless Multiplication (Q4628485) (← links)
- Employing C++ Templates in the Design of a Computer Algebra Library (Q5041073) (← links)
- EFFECTIVE ASYMPTOTICS ANALYSIS FOR FINANCE (Q5114683) (← links)
- Categories as Type Classes in the Scala Algebra System (Q5168475) (← links)
- Mathemagix (Q5175317) (← links)
- Relaxed p-adic Hensel lifting for algebraic systems (Q5244517) (← links)
- Lacunaryx (Q5270184) (← links)
- Sparse polynomials in FLINT (Q5270202) (← links)
- On the computation of the topology of a non-reduced implicit space curve (Q5301602) (← links)
- Automatic asymptotics for coefficients of smooth, bivariate rational functions (Q5494771) (← links)
