Directed evaluation
From MaRDI portal
Publication:2192677
DOI10.1016/j.jco.2020.101498zbMath1475.65013OpenAlexW4253468834MaRDI QIDQ2192677
Joris van der Hoeven, Grégoire Lecerf
Publication date: 17 August 2020
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2020.101498
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Numerical approximation and computational geometry (primarily algorithms) (65D99) Computational methods for problems pertaining to field theory (12-08)
Related Items
A quasi-linear irreducibility test in \(\mathbb{K}x[y\)], Computing Riemann-Roch spaces via Puiseux expansions, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Computing Puiseux series: a fast divide and conquer algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular composition modulo triangular sets and applications
- Relaxed Hensel lifting of triangular sets
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Modular composition via factorization
- On computing the determinant in small parallel time using a small number of processors
- On fast multiplication of polynomials over arbitrary algebras
- An improved parallel processor bound in fast matrix inversion
- Fast rectangular matrix multiplication and applications
- Examples of using dynamic constructible closure.
- Dynamic evaluation and real closure.
- On the complexity of the Lickteig-Roy subresultant algorithm
- Algebraic numbers: An example of dynamic evaluation
- On the complexity of computing with zero-dimensional triangular sets
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Fast multivariate multi-point evaluation revisited
- Accelerated tower arithmetic
- On the factorization of polynomials in a finite number of steps
- Modern Computer Algebra
- Fast algorithms for l -adic towers over finite fields
- Faster Polynomial Multiplication over Finite Fields
- Fast Polynomial Factorization and Modular Composition
- Effective procedures in field theory
- Powers of tensors and fast matrix multiplication
- Sketches and computation – II: dynamic evaluation and applications
- Composition Modulo Powers of Polynomials
- Dynamical method in algebra: Effective Nullstellensätze
- On the links between triangular sets and dynamic constructible closure
