Directed evaluation
From MaRDI portal
Recommendations
Cites work
- Accelerated tower arithmetic
- Algebraic numbers: An example of dynamic evaluation
- An improved parallel processor bound in fast matrix inversion
- Composition modulo powers of polynomials
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Dynamic evaluation and real closure.
- Dynamical method in algebra: Effective Nullstellensätze
- Effective procedures in field theory
- Examples of using dynamic constructible closure.
- Fast algorithms for -adic towers over finite fields
- Fast multivariate multi-point evaluation revisited
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Faster polynomial multiplication over finite fields
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- scientific article; zbMATH DE number 4146129 (Why is no real title available?)
- scientific article; zbMATH DE number 5722788 (Why is no real title available?)
- scientific article; zbMATH DE number 1254236 (Why is no real title available?)
- scientific article; zbMATH DE number 1263378 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1024661 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- Modern computer algebra
- Modular composition modulo triangular sets and applications
- 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
- On the complexity of computing with zero-dimensional triangular sets
- On the complexity of the D5 principle
- On the complexity of the Lickteig-Roy subresultant algorithm
- On the factorization of polynomials in a finite number of steps
- On the links between triangular sets and dynamic constructible closure
- Powers of tensors and fast matrix multiplication
- Relaxed Hensel lifting of triangular sets
- Sketches and computation – II: dynamic evaluation and applications
Cited in
(15)- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Computing Puiseux series: a fast divide and conquer algorithm
- [[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
- Computing Riemann-Roch spaces via Puiseux expansions
- Modular dynamic evaluation
- scientific article; zbMATH DE number 2020233 (Why is no real title available?)
- scientific article; zbMATH DE number 2086907 (Why is no real title available?)
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- Interpolation by decomposable univariate polynomials
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Fast integral bases computation
- Factoring sparse polynomials fast
- Faster modular composition
- Plane curve germs and contact factorization
This page was built for publication: Directed evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192677)
