scientific article; zbMATH DE number 1253989
From MaRDI portal
Publication:4226968
zbMath0928.68145MaRDI QIDQ4226968
Publication date: 12 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (28)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Computational schemes for subresultant chains ⋮ Solving bivariate systems using rational univariate representations ⋮ Multivariate subresultants in roots ⋮ Modular composition modulo triangular sets and applications ⋮ Symmetry detection of rational space curves from their curvature and torsion ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ Genus 2 point counting over prime fields ⋮ An elementary approach to subresultants theory. ⋮ Subresultants revisited. ⋮ On the isotopic meshing of an algebraic implicit surface ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Zero-nonzero and real-nonreal sign determination ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ SqFreeEVAL: An (almost) optimal real-root isolation algorithm ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ Fast computation of special resultants ⋮ A fast version of the Schur-Cohn algorithm. ⋮ Symmetric subresultants and applications ⋮ Bivariate triangular decompositions in the presence of asymptotes ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ On the complexity of computing with planar algebraic curves ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ A worst-case bound for topology computation of algebraic curves ⋮ Multiplicity-preserving triangular set decomposition of two polynomials
This page was built for publication:
