On the intrinsic complexity of elimination problems in effective Algebraic Geometry
Computational Complexity
2012-04-26 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1201.4344,
title = {On the intrinsic complexity of elimination problems in effective Algebraic Geometry},
author = {Joos Heintz and Bart Kuijpers and Andres Rojas Paredes},
journal= {arXiv preprint arXiv:1201.4344},
year = {2012}
}
Comments
37 pages. arXiv admin note: substantial text overlap with arXiv:1110.3030