Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/13258
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Heintz, Joos | - |
dc.contributor.author | KUIJPERS, Bart | - |
dc.contributor.author | Rojas Paredes, Andrés | - |
dc.date.accessioned | 2012-02-29T08:49:56Z | - |
dc.date.available | 2012-02-29T08:49:56Z | - |
dc.date.issued | 2012 | - |
dc.identifier.uri | http://hdl.handle.net/1942/13258 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.title | On the intrinsic complexity of elimination problems in effective Algebraic Geometry | - |
dc.type | Preprint | - |
local.format.pages | 36 | - |
local.bibliographicCitation.jcat | O | - |
local.type.specified | Preprint | - |
dc.identifier.url | http://arxiv.org/abs/1201.4344 | - |
item.accessRights | Open Access | - |
item.contributor | Heintz, Joos | - |
item.contributor | KUIJPERS, Bart | - |
item.contributor | Rojas Paredes, Andrés | - |
item.fulltext | With Fulltext | - |
item.fullcitation | Heintz, Joos; KUIJPERS, Bart & Rojas Paredes, Andrés (2012) On the intrinsic complexity of elimination problems in effective Algebraic Geometry. | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ams.pdf | Non Peer-reviewed author version | 463.36 kB | Adobe PDF | View/Open |
Page view(s)
86
checked on Sep 6, 2022
Download(s)
130
checked on Sep 6, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.