The Euclidean Algorithm and the Degree of the Gauss Map

DOI10.1137/0219036MaRDI QIDQ3476276zbMATH OpenOpenAlexFDO

Authors Takis Sakkalis

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219036

zbMATH Keywords

Gauss mapinteger polynomialstopological degree

Mathematics Subject Classification ID

Fixed points and coincidences in algebraic topology (55M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• Improved subdivision scheme for the root computation of univariate polynomial equations
• A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
• The Euclid algorithm is ``totally Gaussian
• The topological configuration of a real algebraic curve
• Computing the topological degree of polynomial maps
• RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS

This page was built for publication: The Euclidean Algorithm and the Degree of the Gauss Map

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