Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13258
Title: On the intrinsic complexity of elimination problems in effective Algebraic Geometry
Authors: Heintz, Joos
KUIJPERS, Bart 
Rojas Paredes, Andrés
Issue Date: 2012
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.
Document URI: http://hdl.handle.net/1942/13258
Link to publication: http://arxiv.org/abs/1201.4344
Category: O
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
ams.pdf463.36 kBAdobe PDFView/Open
Show full item record

Page view(s)

82
checked on May 20, 2022

Download(s)

112
checked on May 20, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.