Lifting techniques for triangular decompositions
DOI10.1145/1073884.1073901zbMATH Open1360.14146OpenAlexW2150489476MaRDI QIDQ5262750FDOQ5262750
Authors: Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie 
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
Recommendations
Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99) Polynomials, factorization in commutative rings (13P05)
Cited In (25)
- Inversion modulo zero-dimensional regular chains
- Change of order for regular chains in positive dimension
- Usage of modular techniques for efficient computation of ideal operations
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- p-adic algorithm for bivariate Gröbner bases
- Algorithms for computing triangular decomposition of polynomial systems
- Characteristic set algorithms for equation solving in finite fields
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Bit-size estimates for triangular sets in positive dimension
- Complexity of triangular representations of algebraic sets
- Chordality preserving incremental triangular decomposition and its implementation
- Multiplicity-preserving triangular set decomposition of two polynomials
- Clustering complex zeros of triangular systems of polynomials
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- On approximate triangular decompositions in dimension zero
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relaxed Hensel lifting of triangular sets
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Counting the integer points of parametric polytopes: a Maple implementation
- Homotopy techniques for multiplication modulo triangular sets
- Fast arithmetic for triangular sets: from theory to practice
This page was built for publication: Lifting techniques for triangular decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262750)
