www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
All items >

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.
URI: http://hdl.handle.net/1942/13258
Link to publication: http://arxiv.org/abs/1201.4344
Category: O
Type: Preprint
Appears in Collections: Databases and Theoretical Computer Science

Files in This Item:

Description SizeFormat
View/OpenN/A463.36 kBAdobe PDF

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