On the intrinsic complexity of elimination problems in effective algebraic geometry

DOI10.1090/conm/604/12071zbMath1317.68058arXiv1201.4344OpenAlexW1591673025MaRDI QIDQ5501606

Andrés Rojas Paredes, Bart Kuijpers, Joos Heintz

Publication date: 4 August 2015

Published in: Recent Advances in Real Complexity and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4344

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (2)

Quiz games as a model for information hiding ⋮ Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity

This page was built for publication: On the intrinsic complexity of elimination problems in effective algebraic geometry