Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14867
Title: | Software Engineering and complexity in effective Algebraic Geometry | Authors: | Heintz, Joos KUIJPERS, Bart Paredes, Andres Rojas |
Issue Date: | 2013 | Source: | JOURNAL OF COMPLEXITY, 29 (1), p. 92-138 | Abstract: | One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the past fifteen years considerable complexity progress in effective polynomial equation solving. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibit a class of simple elimination problems which require exponential size circuits to be solved in this model. This implies that the known, circuit based elimination algorithms are already optimal. | Keywords: | Software engineering; Complexity; Algebraic Geometry; Databases | Document URI: | http://hdl.handle.net/1942/14867 | ISSN: | 0885-064X | e-ISSN: | 1090-2708 | DOI: | 10.1016/j.jco.2012.04.005 | ISI #: | 000313312400006 | Rights: | Journal of Complexity copyright | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2014 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
JoComplexity-2013.pdf Restricted Access | Published version | 466.31 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
6
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
8
checked on Sep 28, 2024
Page view(s)
118
checked on Sep 5, 2022
Download(s)
112
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.