Sharp estimates for triangular sets

DOI10.1145/1005285.1005302MaRDI QIDQ4657308zbMATH OpenOpenAlexFDO

Authors Xavier Dahan, Éric Schost

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005302

Mathematics Subject Classification ID

Heights (11G50) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Complexity results for triangular sets
• scientific article; zbMATH DE number 2151241
• Bit-size estimates for triangular sets in positive dimension
• Complexity of triangular representations of algebraic sets
• On the complexity of computing with zero-dimensional triangular sets

Cited in

(28)

• A characteristic set method for ordinary difference polynomial systems
• Complexity of triangular representations of algebraic sets
• The complexity of computing all subfields of an algebraic number field
• Efficient arithmetic in successive algebraic extension fields using symmetries
• Usage of modular techniques for efficient computation of ideal operations
• Multilinear polynomial systems: root isolation and bit complexity
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Bit complexity for computing one point in each connected component of a smooth real algebraic set
• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Solving determinantal systems using homotopy techniques
• Complexity of solving parametric polynomial systems
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Sharp bounds for eigenvalues of triangles
• On approximate triangular decompositions in dimension zero
• Change of order for regular chains in positive dimension
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• Exact algorithms for linear matrix inequalities
• Change of order for bivariate triangular sets
• Exact certification in global polynomial optimization via rationalizing sums-of-squares
• Genus 2 point counting over prime fields
• Separating linear forms and rational univariate representations of bivariate systems
• On computing absolutely irreducible components of algebraic varieties with parameters
• Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
• p-adic algorithm for bivariate Gröbner bases
• Bit-size estimates for triangular sets in positive dimension
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
• Isomorphisms of algebraic number fields
• Sharp bounds for cyclic sums of the ratio of the exradius to the sides of a triangle

This page was built for publication: Sharp estimates for triangular sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657308)