www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/16537

Title: On the intrinsic complexity of elimination problems in effective algebraic geometry
Authors: Heintz, Joos
Kuijpers, Bart
Rojas Paredes, Andrés
Issue Date: 2013
Citation: Contemporary Mathematics, 604, p. 129-150
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 the core of all known symbolic elimination algorithms that avoid unnecessary branchings in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model.
URI: http://hdl.handle.net/1942/16537
Link to publication: http://arxiv.org/abs/1201.4344
DOI: 10.1090/conm/604/12071
ISI #: 000330197900005
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
main article1.15 MBAdobe PDF

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