Fast arithmetic for triangular sets: from theory to practice
From MaRDI portal
Publication:1025397
DOI10.1016/J.JSC.2008.04.019zbMATH Open1183.68755OpenAlexW2052338752MaRDI QIDQ1025397FDOQ1025397
Authors: Xin Li, Marc Moreno Maza, Éric Schost 
Publication date: 18 June 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.019
Recommendations
- Fast arithmetic for triangular sets: from theory to practice
- Homotopy techniques for multiplication modulo triangular sets
- Algorithms for computing triangular decompositions of polynomial systems
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- On the complexity of computing with zero-dimensional triangular sets
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- The Magma algebra system. I: The user language
- The RegularChains library in Maple 10
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- Fast multiplication of large numbers
- Modular Multiplication Without Trial Division
- Lifting techniques for triangular decompositions
- On the theories of triangular sets
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Modern computer algebra
- A new method for solving algebraic systems of positive dimension
- Simple multivariate polynomial multiplication
- On computing reciprocals of power series
- An algorithm for division of powerseries
- A new polynomial factorization algorithm and its implementation
- Fast arithmetic for triangular sets: from theory to practice
- Architecture-aware classical Taylor shift by 1
- Title not available (Why is that?)
- Relations between exact and approximate bilinear algorithms. Applications
- The truncated fourier transform and applications
- Approximate Solutions for the Bilinear Form Computational Problem
- Efficient implementation of polynomial arithmetic in a multiple-level programming environment
- Title not available (Why is that?)
- Multivariate power series multiplication
- On the complexities of multipoint evaluation and interpolation
Cited In (14)
- Inversion modulo zero-dimensional regular chains
- Accelerated tower arithmetic
- On the complexity of the D5 principle
- Complexity results for triangular sets
- Modular composition modulo triangular sets and applications
- Fast arithmetic for triangular sets: from theory to practice
- Subquadratic-time algorithms for normal bases
- Fast vector arithmetic over \(\mathbb{F}_3\)
- Relaxed Hensel lifting of triangular sets
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Efficient arithmetic in successive algebraic extension fields using symmetries
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
- Homotopy techniques for multiplication modulo triangular sets
Uses Software
This page was built for publication: Fast arithmetic for triangular sets: from theory to practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025397)
