论有效代数几何中消元问题的内在复杂性
On the intrinsic complexity of elimination problems in effective Algebraic Geometry
摘要：
多项式的算术电路评估他们的代表是一种替代数据结构，允许在多项式方程求解相当大的进展，在过去的十五年。我们提出了一个基于电路的计算模型，它捕获了所有已知的符号消除算法在有效的代数几何，并显示在这个复杂性模型消除的内在指数复杂性字符。
英文摘要：
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
