Sharp estimates for triangular sets

DOI10.1145/1005285.1005302zbMath1134.13308OpenAlexW1996430549MaRDI QIDQ4657308

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

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

Related Items (24)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Genus 2 point counting over prime fields ⋮ Efficient arithmetic in successive algebraic extension fields using symmetries ⋮ Complexity of triangular representations of algebraic sets ⋮ Bit-size estimates for triangular sets in positive dimension ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ The complexity of computing all subfields of an algebraic number field ⋮ Solving determinantal systems using homotopy techniques ⋮ On approximate triangular decompositions in dimension zero ⋮ Usage of modular techniques for efficient computation of ideal operations ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Change of order for regular chains in positive dimension ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ Complexity of solving parametric polynomial systems ⋮ Isomorphisms of algebraic number fields ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ A characteristic set method for ordinary difference polynomial systems ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ 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

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