The following pages link to Relax, but don't be too lazy (Q1866999):
Displaying 41 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- Meta-expansion of transseries (Q629344) (← links)
- Computing with D-algebraic power series (Q669617) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- Modular composition via factorization (Q722764) (← links)
- Computations with effective real numbers (Q817859) (← links)
- Effective approximation of the solutions of algebraic equations (Q820948) (← links)
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- On asymptotic extrapolation (Q1023265) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Formal desingularization of surfaces: The Jung method revisited (Q2377955) (← links)
- Effective power series computations (Q2420635) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Effective analytic functions (Q2456553) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- On the coefficients that arise from Laplace's method (Q2499810) (← links)
- Nature of complex singularities for the 2D Euler equation (Q2500680) (← links)
- A Borel transform method for locating singularities of Taylor and Fourier series (Q2641375) (← links)
- Tracking \(p\)-adic precision (Q2878841) (← links)
- Computing solutions of linear Mahler equations (Q3177728) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- Lazy and Forgetful Polynomial Arithmetic and Applications (Q3644102) (← links)
- On the Complexity of Multivariate Polynomial Division (Q4610026) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability (Q6043379) (← links)
- A zero test for \(\sigma \)-algebraic power Series (Q6666535) (← links)
