Semi-algebraic complexity of quotients and sign determination of remainders

DOI10.1006/jcom.1996.0033zbMath0868.68069OpenAlexW1964288820MaRDI QIDQ2365423

Thomas Lickteig, Marie-Françoise Roy

Publication date: 4 February 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1996.0033

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Computational schemes for subresultant chains ⋮ Semi-algebraic complexity -- Additive complexity of matrix computational tasks ⋮ An elementary approach to subresultants theory. ⋮ On the parallel complexity of the polynomial ideal membership problem

This page was built for publication: Semi-algebraic complexity of quotients and sign determination of remainders