Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13256
Title: Software Engineering and Complexity in Effective Algebraic Geometry
Authors: Heintz, Joos
KUIJPERS, Bart 
Rojas Paredes, Andrés
Issue Date: 2011
Abstract: We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model, adapted to Scientific Computing, which captures all known branching parsimonious symbolic algorithms in effective Algebraic Geometry. We justify this model by arguments from Software Engineering. Finally we exhibit a class of simple elimination problems of effective Algebraic Geometry which require exponential time to be solved by branching parsimonious algorithms of our computation model.
Keywords: Software engineering; Effective Algebraic Geometry
Document URI: http://hdl.handle.net/1942/13256
Link to publication: http://arxiv.org/abs/1110.3030
Category: O
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
1110.3030v2.pdf623.05 kBAdobe PDFView/Open
Show full item record

Page view(s)

52
checked on May 25, 2022

Download(s)

92
checked on May 25, 2022

Google ScholarTM

Check


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