Lifting techniques for triangular decompositions
From MaRDI portal
Publication:5262750
DOI10.1145/1073884.1073901zbMath1360.14146OpenAlexW2150489476MaRDI QIDQ5262750
Marc Moreno Maza, Yuzhen Xie, Wenyuan Wu, Xavier Dahan, Éric Schost
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.9044
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Computational aspects in algebraic geometry (14Q99)
Related Items (21)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Chordality Preserving Incremental Triangular Decomposition and Its Implementation ⋮ Inversion Modulo Zero-Dimensional Regular Chains ⋮ A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Algorithms for computing triangular decomposition of polynomial systems ⋮ Characteristic set algorithms for equation solving in finite fields ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Complexity of triangular representations of algebraic sets ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ Bit-size estimates for triangular sets in positive dimension ⋮ Relaxed Hensel lifting of triangular sets ⋮ On approximate triangular decompositions in dimension zero ⋮ Usage of modular techniques for efficient computation of ideal operations ⋮ Change of order for regular chains in positive dimension ⋮ The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ Fast arithmetic for triangular sets: from theory to practice ⋮ Multiplicity-preserving triangular set decomposition of two polynomials
This page was built for publication: Lifting techniques for triangular decompositions
