The Euclidean Algorithm and the Degree of the Gauss Map

DOI10.1137/0219036zbMath0698.68048OpenAlexW1964087039MaRDI QIDQ3476276

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 maptopological degreeinteger polynomials

Mathematics Subject Classification ID

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

Related Items (5)

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

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