Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Heintz, Joos Ulrich | - |
| dc.creator | Kuijpers, Bart | - |
| dc.creator | Rojas Paredes, Andres Avelino | - |
| dc.date | 2017-04-28T20:37:43Z | - |
| dc.date | 2017-04-28T20:37:43Z | - |
| dc.date | 2013-02 | - |
| dc.date | 2017-04-28T20:28:46Z | - |
| dc.date.accessioned | 2019-04-29T15:41:49Z | - |
| dc.date.available | 2019-04-29T15:41:49Z | - |
| dc.date.issued | 2013-02 | - |
| dc.identifier | Heintz, Joos Ulrich; Kuijpers, Bart; Rojas Paredes, Andres Avelino; Software Engineering and complexity in effective Algebraic Geometry; Elsevier Inc; Journal Of Complexity; 29; 1; 2-2013; 92-138 | - |
| dc.identifier | 0885-064X | - |
| dc.identifier | http://hdl.handle.net/11336/15847 | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/299794 | - |
| dc.description | 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. | - |
| dc.description | Fil: Heintz, Joos Ulrich. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Cantabria; España. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Kuijpers, Bart. Hasselt University; Bélgica | - |
| dc.description | Fil: Rojas Paredes, Andres Avelino. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Elsevier Inc | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.jco.2012.04.005 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0885064X1200043X | - |
| dc.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.rights | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | - |
| dc.source | reponame:CONICET Digital (CONICET) | - |
| dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
| dc.source | instacron:CONICET | - |
| dc.subject | ROBUST PARAMETERIZED ARITHMETIC CIRCUIT | - |
| dc.subject | ISOPARAMETRIC ROUTINE | - |
| dc.subject | BRANCHING PARSIMONIOUS ALGORITHM | - |
| dc.subject | FLAT FAMILY OF ZERO DIMENSIONAL ELIMINATION PROBLEMS | - |
| dc.subject | Ciencias de la Computación | - |
| dc.subject | Ciencias de la Computación e Información | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | Software Engineering and complexity in effective Algebraic Geometry | - |
| dc.type | info:eu-repo/semantics/article | - |
| dc.type | info:eu-repo/semantics/publishedVersion | - |
| dc.type | info:ar-repo/semantics/articulo | - |
| Aparece en las colecciones: | CONICET | |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.