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 | Source: | 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. | Keywords: | effective algebraic geometry; quantifier elimination | Document URI: | http://hdl.handle.net/1942/16537 | Link to publication/dataset: | http://arxiv.org/abs/1201.4344 | DOI: | 10.1090/conm/604/12071 | ISI #: | 000330197900005 | Rights: | Copyright by American Mathematical Society | Category: | A1 | Type: | Journal Contribution |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
conm12071.pdf Restricted Access | Published version | 1.15 MB | Adobe PDF | View/Open Request a copy |
WEB OF SCIENCETM
Citations
1
checked on Oct 4, 2024
Page view(s)
96
checked on Sep 7, 2022
Download(s)
88
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.