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